./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-7.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-7.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 c08a3d5297bbbcb5881c67d5d83d8ac90b7c708d5d59dacfddb9a4d6bdd83c53 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:07:10,364 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:07:10,419 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:07:10,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:07:10,426 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:07:10,443 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:07:10,444 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:07:10,444 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:07:10,445 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:07:10,445 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:07:10,446 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:07:10,446 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:07:10,446 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:07:10,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:07:10,446 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:07:10,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:07:10,446 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:07:10,447 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:07:10,447 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:07:10,447 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:07:10,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:07:10,447 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:07:10,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:07:10,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:07:10,447 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:07:10,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:07:10,448 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:07:10,448 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:07:10,448 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:07:10,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:07:10,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:07:10,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:07:10,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:07:10,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:07:10,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:07:10,448 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:07:10,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:07:10,448 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:07:10,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:07:10,448 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:07:10,448 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:07:10,448 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:07:10,448 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:07:10,448 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 -> c08a3d5297bbbcb5881c67d5d83d8ac90b7c708d5d59dacfddb9a4d6bdd83c53 [2025-02-06 04:07:10,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:07:10,697 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:07:10,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:07:10,699 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:07:10,699 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:07:10,700 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-7.i [2025-02-06 04:07:11,824 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc0ba474f/ba6c9e6a49cf4da7a1ef492fc550d2b2/FLAGc0d11e9c7 [2025-02-06 04:07:12,064 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:07:12,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-7.i [2025-02-06 04:07:12,072 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc0ba474f/ba6c9e6a49cf4da7a1ef492fc550d2b2/FLAGc0d11e9c7 [2025-02-06 04:07:12,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dc0ba474f/ba6c9e6a49cf4da7a1ef492fc550d2b2 [2025-02-06 04:07:12,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:07:12,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:07:12,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:07:12,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:07:12,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:07:12,401 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:07:12" (1/1) ... [2025-02-06 04:07:12,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6141100a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:12, skipping insertion in model container [2025-02-06 04:07:12,402 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:07:12" (1/1) ... [2025-02-06 04:07:12,419 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:07:12,529 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-7.i[916,929] [2025-02-06 04:07:12,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:07:12,593 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:07:12,601 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-7.i[916,929] [2025-02-06 04:07:12,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:07:12,658 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:07:12,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:12 WrapperNode [2025-02-06 04:07:12,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:07:12,659 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:07:12,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:07:12,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:07:12,664 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:07:12" (1/1) ... [2025-02-06 04:07:12,675 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:07:12" (1/1) ... [2025-02-06 04:07:12,704 INFO L138 Inliner]: procedures = 30, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 483 [2025-02-06 04:07:12,704 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:07:12,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:07:12,705 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:07:12,705 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:07:12,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:12" (1/1) ... [2025-02-06 04:07:12,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:12" (1/1) ... [2025-02-06 04:07:12,721 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:12" (1/1) ... [2025-02-06 04:07:12,730 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 04:07:12,730 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:12" (1/1) ... [2025-02-06 04:07:12,730 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:12" (1/1) ... [2025-02-06 04:07:12,746 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:12" (1/1) ... [2025-02-06 04:07:12,747 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:12" (1/1) ... [2025-02-06 04:07:12,748 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:12" (1/1) ... [2025-02-06 04:07:12,754 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:12" (1/1) ... [2025-02-06 04:07:12,757 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:07:12,757 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:07:12,757 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:07:12,757 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:07:12,758 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:12" (1/1) ... [2025-02-06 04:07:12,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:07:12,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:07:12,785 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:07:12,788 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:07:12,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:07:12,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 04:07:12,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 04:07:12,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 04:07:12,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 04:07:12,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 04:07:12,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 04:07:12,808 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:07:12,809 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:07:12,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 04:07:12,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:07:12,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:07:12,901 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:07:12,903 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:07:13,324 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite88#1;havoc property_#t~ite85#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem92#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~short93#1;havoc property_#t~ite104#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short96#1;havoc property_#t~ite101#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~short105#1;havoc property_#t~mem106#1;havoc property_#t~ite131#1;havoc property_#t~mem109#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~short110#1;havoc property_#t~ite128#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~ite115#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~mem116#1;havoc property_#t~ite127#1;havoc property_#t~mem124#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~ite123#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~mem130#1;havoc property_#t~mem129#1;havoc property_#t~short132#1; [2025-02-06 04:07:13,369 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2025-02-06 04:07:13,370 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:07:13,378 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:07:13,378 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:07:13,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:07:13 BoogieIcfgContainer [2025-02-06 04:07:13,378 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:07:13,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:07:13,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:07:13,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:07:13,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:07:12" (1/3) ... [2025-02-06 04:07:13,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20dbbc36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:07:13, skipping insertion in model container [2025-02-06 04:07:13,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:12" (2/3) ... [2025-02-06 04:07:13,387 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20dbbc36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:07:13, skipping insertion in model container [2025-02-06 04:07:13,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:07:13" (3/3) ... [2025-02-06 04:07:13,389 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-7.i [2025-02-06 04:07:13,402 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:07:13,403 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-7.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 04:07:13,444 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:07:13,451 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;@478da718, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:07:13,451 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:07:13,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 04:07:13,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 04:07:13,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:13,461 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:13,462 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:13,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:13,465 INFO L85 PathProgramCache]: Analyzing trace with hash -884000999, now seen corresponding path program 1 times [2025-02-06 04:07:13,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:13,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613803429] [2025-02-06 04:07:13,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:13,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:13,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 04:07:13,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 04:07:13,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:13,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:13,739 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-02-06 04:07:13,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:13,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613803429] [2025-02-06 04:07:13,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613803429] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:07:13,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050608893] [2025-02-06 04:07:13,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:13,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:07:13,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:07:13,745 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:07:13,748 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:07:13,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 04:07:13,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 04:07:13,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:13,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:13,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:07:14,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:14,021 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-02-06 04:07:14,023 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:07:14,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1050608893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:14,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:07:14,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 04:07:14,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312976448] [2025-02-06 04:07:14,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:14,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:07:14,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:14,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:07:14,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:07:14,047 INFO L87 Difference]: Start difference. First operand has 99 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 04:07:14,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:14,065 INFO L93 Difference]: Finished difference Result 192 states and 301 transitions. [2025-02-06 04:07:14,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:07:14,066 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2025-02-06 04:07:14,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:14,071 INFO L225 Difference]: With dead ends: 192 [2025-02-06 04:07:14,072 INFO L226 Difference]: Without dead ends: 96 [2025-02-06 04:07:14,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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:07:14,077 INFO L435 NwaCegarLoop]: 138 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, 138 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:07:14,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:07:14,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-06 04:07:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-06 04:07:14,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 04:07:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2025-02-06 04:07:14,108 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 103 [2025-02-06 04:07:14,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:14,109 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2025-02-06 04:07:14,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 04:07:14,109 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2025-02-06 04:07:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 04:07:14,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:14,112 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:14,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 04:07:14,313 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:07:14,314 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:14,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:14,315 INFO L85 PathProgramCache]: Analyzing trace with hash -515278063, now seen corresponding path program 1 times [2025-02-06 04:07:14,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:14,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864891410] [2025-02-06 04:07:14,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:14,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:14,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 04:07:14,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 04:07:14,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:14,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:14,537 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 04:07:14,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:14,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864891410] [2025-02-06 04:07:14,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864891410] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:14,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:14,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:07:14,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28468649] [2025-02-06 04:07:14,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:14,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:07:14,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:14,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:07:14,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:07:14,540 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 04:07:14,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:14,566 INFO L93 Difference]: Finished difference Result 191 states and 276 transitions. [2025-02-06 04:07:14,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:07:14,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-02-06 04:07:14,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:14,568 INFO L225 Difference]: With dead ends: 191 [2025-02-06 04:07:14,568 INFO L226 Difference]: Without dead ends: 98 [2025-02-06 04:07:14,568 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:07:14,569 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:14,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 398 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:07:14,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-06 04:07:14,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-06 04:07:14,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 04:07:14,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2025-02-06 04:07:14,576 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 103 [2025-02-06 04:07:14,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:14,576 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2025-02-06 04:07:14,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 04:07:14,576 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2025-02-06 04:07:14,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 04:07:14,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:14,578 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:14,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:07:14,578 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:14,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:14,582 INFO L85 PathProgramCache]: Analyzing trace with hash 437923570, now seen corresponding path program 1 times [2025-02-06 04:07:14,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:14,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523795274] [2025-02-06 04:07:14,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:14,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:14,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 04:07:14,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 04:07:14,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:14,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:17,151 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 04:07:17,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:17,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523795274] [2025-02-06 04:07:17,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523795274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:17,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:17,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 04:07:17,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284652742] [2025-02-06 04:07:17,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:17,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 04:07:17,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:17,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 04:07:17,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 04:07:17,154 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 04:07:17,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:17,728 INFO L93 Difference]: Finished difference Result 197 states and 282 transitions. [2025-02-06 04:07:17,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:07:17,730 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2025-02-06 04:07:17,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:17,731 INFO L225 Difference]: With dead ends: 197 [2025-02-06 04:07:17,731 INFO L226 Difference]: Without dead ends: 102 [2025-02-06 04:07:17,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:07:17,732 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 227 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:17,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 304 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 04:07:17,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-06 04:07:17,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2025-02-06 04:07:17,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.372093023255814) internal successors, (118), 86 states have internal predecessors, (118), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 04:07:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2025-02-06 04:07:17,747 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 103 [2025-02-06 04:07:17,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:17,748 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2025-02-06 04:07:17,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 04:07:17,749 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2025-02-06 04:07:17,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 04:07:17,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:17,753 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:17,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:07:17,754 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:17,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:17,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1341281359, now seen corresponding path program 1 times [2025-02-06 04:07:17,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:17,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476171852] [2025-02-06 04:07:17,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:17,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:17,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 04:07:17,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 04:07:17,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:17,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:19,321 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 04:07:19,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:07:19,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476171852] [2025-02-06 04:07:19,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476171852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:19,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:19,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 04:07:19,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801556978] [2025-02-06 04:07:19,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:19,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 04:07:19,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:07:19,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 04:07:19,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-06 04:07:19,323 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 04:07:19,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:19,892 INFO L93 Difference]: Finished difference Result 199 states and 283 transitions. [2025-02-06 04:07:19,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 04:07:19,894 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2025-02-06 04:07:19,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:19,895 INFO L225 Difference]: With dead ends: 199 [2025-02-06 04:07:19,897 INFO L226 Difference]: Without dead ends: 102 [2025-02-06 04:07:19,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-06 04:07:19,898 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 162 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:19,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 418 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 04:07:19,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-06 04:07:19,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2025-02-06 04:07:19,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.369047619047619) internal successors, (115), 84 states have internal predecessors, (115), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 04:07:19,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 139 transitions. [2025-02-06 04:07:19,908 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 139 transitions. Word has length 105 [2025-02-06 04:07:19,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:19,909 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 139 transitions. [2025-02-06 04:07:19,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.363636363636363) internal successors, (48), 12 states have internal predecessors, (48), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-06 04:07:19,910 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 139 transitions. [2025-02-06 04:07:19,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-02-06 04:07:19,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:19,912 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:19,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:07:19,912 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:19,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:19,912 INFO L85 PathProgramCache]: Analyzing trace with hash -176324313, now seen corresponding path program 1 times [2025-02-06 04:07:19,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:07:19,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920867286] [2025-02-06 04:07:19,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:19,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:07:19,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 04:07:20,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 04:07:20,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:20,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 04:07:20,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1110781599] [2025-02-06 04:07:20,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:20,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:07:20,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:07:20,037 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:07:20,039 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:07:20,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 04:07:20,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 04:07:20,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:20,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:07:20,544 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:07:20,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-02-06 04:07:20,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-02-06 04:07:20,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:20,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:07:20,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:07:20,858 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:07:20,859 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 04:07:20,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 04:07:21,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:07:21,063 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 04:07:21,157 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:07:21,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:07:21 BoogieIcfgContainer [2025-02-06 04:07:21,161 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:07:21,162 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:07:21,162 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:07:21,162 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:07:21,163 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:07:13" (3/4) ... [2025-02-06 04:07:21,165 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 04:07:21,166 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:07:21,166 INFO L158 Benchmark]: Toolchain (without parser) took 8769.55ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 122.7MB in the beginning and 290.3MB in the end (delta: -167.6MB). Peak memory consumption was 88.2MB. Max. memory is 16.1GB. [2025-02-06 04:07:21,168 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:07:21,169 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.18ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 107.1MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:07:21,169 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.03ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 104.1MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:07:21,169 INFO L158 Benchmark]: Boogie Preprocessor took 51.87ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 101.7MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:07:21,169 INFO L158 Benchmark]: IcfgBuilder took 621.13ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 68.6MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 04:07:21,169 INFO L158 Benchmark]: TraceAbstraction took 7781.39ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 68.1MB in the beginning and 290.4MB in the end (delta: -222.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2025-02-06 04:07:21,169 INFO L158 Benchmark]: Witness Printer took 3.83ms. Allocated memory is still 419.4MB. Free memory was 290.4MB in the beginning and 290.3MB in the end (delta: 87.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 04:07:21,170 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.15ms. Allocated memory is still 201.3MB. Free memory is still 116.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.18ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 107.1MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.03ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 104.1MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 51.87ms. Allocated memory is still 167.8MB. Free memory was 104.1MB in the beginning and 101.7MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 621.13ms. Allocated memory is still 167.8MB. Free memory was 101.7MB in the beginning and 68.6MB in the end (delta: 33.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7781.39ms. Allocated memory was 167.8MB in the beginning and 419.4MB in the end (delta: 251.7MB). Free memory was 68.1MB in the beginning and 290.4MB in the end (delta: -222.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Witness Printer took 3.83ms. Allocated memory is still 419.4MB. Free memory was 290.4MB in the beginning and 290.3MB in the end (delta: 87.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 62, overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 111. Possible FailurePath: [L34] unsigned char isInitial = 0; [L35-L46] struct WrapperStruct00 WrapperStruct00 = { 1, 8.2, 100000000000.4, 4, 0.2, 0, 32, 1, 127.5, 5 }; [L47] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L48] float* WrapperStruct00_var_1_3_Pointer = &(WrapperStruct00.var_1_3); [L49] float* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L50] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L51] double* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L52] unsigned char* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L53] unsigned short int* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L54] unsigned char* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L55] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L56] unsigned long int* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L57] double last_1_WrapperStruct00_var_1_7 = 0.2; [L58] unsigned long int last_1_WrapperStruct00_var_1_12 = 5; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=0, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] CALL updateLastVariables() [L114] EXPR WrapperStruct00.var_1_7 [L114] last_1_WrapperStruct00_var_1_7 = WrapperStruct00.var_1_7 [L115] EXPR WrapperStruct00.var_1_12 [L115] last_1_WrapperStruct00_var_1_12 = WrapperStruct00.var_1_12 [L125] RET updateLastVariables() [L126] CALL updateVariables() [L93] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L94] EXPR WrapperStruct00.var_1_3 [L94] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_3 [L94] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L94] EXPR (WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L95] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L96] EXPR WrapperStruct00.var_1_4 [L96] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_4 [L96] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L96] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L97] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L98] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L99] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L100] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L101] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L102] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L103] WrapperStruct00.var_1_9 = __VERIFIER_nondet_ushort() [L104] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L105] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 65535) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 65535) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L106] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_9 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_9 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L107] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L109] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L110] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L111] EXPR WrapperStruct00.var_1_11 [L111] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_11 [L111] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L111] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L126] RET updateVariables() [L127] CALL step() [L62] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L62] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L62] COND FALSE !(! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) [L69] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L69] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_6_Pointer)) [L71] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L71] (*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer))) [L71] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L71] (*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L71] COND FALSE !((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) [L78] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L78] (*(WrapperStruct00_var_1_7_Pointer)) = (*(WrapperStruct00_var_1_11_Pointer)) [L80] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L80] COND FALSE !((*(WrapperStruct00_var_1_8_Pointer))) [L89] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L89] (*(WrapperStruct00_var_1_12_Pointer)) = (*(WrapperStruct00_var_1_6_Pointer)) [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR \read(*WrapperStruct00_var_1_3_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_4_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118] EXPR (! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) [L118] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L118] EXPR (! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118] EXPR ((! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) && (((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) [L118] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L118] EXPR (*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer))) [L118] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_9_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L118] EXPR (*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) [L118] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L118] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L118] EXPR ((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118] EXPR ((! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) && (((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118] EXPR (((! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) && (((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))))) && ((*(WrapperStruct00_var_1_8_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer)))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))) > (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) ((((((3725801564u - (*(WrapperStruct00_var_1_6_Pointer))) - (*(WrapperStruct00_var_1_1_Pointer)))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (((3725801564u - (*(WrapperStruct00_var_1_6_Pointer))) - (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_6_Pointer))))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_6_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L118-L119] return (((! (last_1_WrapperStruct00_var_1_7 <= ((*(WrapperStruct00_var_1_3_Pointer)) - (*(WrapperStruct00_var_1_4_Pointer))))) ? ((-1 < last_1_WrapperStruct00_var_1_12) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_6_Pointer))))) && (((*(WrapperStruct00_var_1_8_Pointer)) || (((*(WrapperStruct00_var_1_6_Pointer)) / (*(WrapperStruct00_var_1_9_Pointer))) >= (*(WrapperStruct00_var_1_1_Pointer)))) ? (((*(WrapperStruct00_var_1_8_Pointer)) && (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer))))) : ((*(WrapperStruct00_var_1_7_Pointer)) == ((double) (*(WrapperStruct00_var_1_11_Pointer)))))) && ((*(WrapperStruct00_var_1_8_Pointer)) ? (((*(WrapperStruct00_var_1_10_Pointer)) && ((*(WrapperStruct00_var_1_4_Pointer)) <= (*(WrapperStruct00_var_1_7_Pointer)))) ? (((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_11_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_11_Pointer))))) > (*(WrapperStruct00_var_1_7_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) ((((((3725801564u - (*(WrapperStruct00_var_1_6_Pointer))) - (*(WrapperStruct00_var_1_1_Pointer)))) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (((3725801564u - (*(WrapperStruct00_var_1_6_Pointer))) - (*(WrapperStruct00_var_1_1_Pointer)))) : ((*(WrapperStruct00_var_1_9_Pointer))))))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_6_Pointer))))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned long int) (*(WrapperStruct00_var_1_6_Pointer))))) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:21}, WrapperStruct00_var_1_11_Pointer={4:22}, WrapperStruct00_var_1_12_Pointer={4:30}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_3_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:5}, WrapperStruct00_var_1_6_Pointer={4:9}, WrapperStruct00_var_1_7_Pointer={4:10}, WrapperStruct00_var_1_8_Pointer={4:18}, WrapperStruct00_var_1_9_Pointer={4:19}, isInitial=1, last_1_WrapperStruct00_var_1_12=5, last_1_WrapperStruct00_var_1_7=1/5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.6s, OverallIterations: 5, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 391 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 389 mSDsluCounter, 1258 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 828 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 823 IncrementalHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 430 mSDtfsCounter, 823 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 729 NumberOfCodeBlocks, 729 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 512 ConstructedInterpolants, 0 QuantifiedInterpolants, 4322 SizeOfPredicates, 0 NumberOfNonLiveVariables, 419 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 1298/1320 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:07:21,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-7.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 c08a3d5297bbbcb5881c67d5d83d8ac90b7c708d5d59dacfddb9a4d6bdd83c53 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:07:23,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:07:23,148 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:07:23,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:07:23,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:07:23,177 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:07:23,179 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:07:23,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:07:23,179 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:07:23,179 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:07:23,180 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:07:23,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:07:23,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:07:23,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:07:23,181 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:07:23,181 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:07:23,181 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:07:23,181 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:07:23,181 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:07:23,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:07:23,182 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:07:23,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:07:23,182 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:07:23,182 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 04:07:23,182 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 04:07:23,182 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 04:07:23,182 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:07:23,182 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:07:23,182 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:07:23,182 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:07:23,183 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:07:23,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:07:23,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:07:23,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:07:23,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:07:23,183 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:07:23,183 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:07:23,183 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:07:23,184 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:07:23,184 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 04:07:23,184 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 04:07:23,184 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:07:23,184 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:07:23,184 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:07:23,184 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:07:23,184 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 -> c08a3d5297bbbcb5881c67d5d83d8ac90b7c708d5d59dacfddb9a4d6bdd83c53 [2025-02-06 04:07:23,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:07:23,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:07:23,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:07:23,433 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:07:23,433 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:07:23,434 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-7.i [2025-02-06 04:07:24,593 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7567ec844/c1e02b8d525f493482154e56b33c2f70/FLAGb860d4d23 [2025-02-06 04:07:24,770 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:07:24,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-7.i [2025-02-06 04:07:24,777 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7567ec844/c1e02b8d525f493482154e56b33c2f70/FLAGb860d4d23 [2025-02-06 04:07:24,790 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7567ec844/c1e02b8d525f493482154e56b33c2f70 [2025-02-06 04:07:24,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:07:24,794 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:07:24,795 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:07:24,795 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:07:24,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:07:24,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:07:24" (1/1) ... [2025-02-06 04:07:24,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7df1e43f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:24, skipping insertion in model container [2025-02-06 04:07:24,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:07:24" (1/1) ... [2025-02-06 04:07:24,813 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:07:24,914 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-7.i[916,929] [2025-02-06 04:07:24,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:07:24,980 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:07:24,989 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-7.i[916,929] [2025-02-06 04:07:25,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:07:25,036 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:07:25,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:25 WrapperNode [2025-02-06 04:07:25,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:07:25,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:07:25,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:07:25,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:07:25,043 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:07:25" (1/1) ... [2025-02-06 04:07:25,056 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:07:25" (1/1) ... [2025-02-06 04:07:25,085 INFO L138 Inliner]: procedures = 40, calls = 146, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 482 [2025-02-06 04:07:25,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:07:25,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:07:25,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:07:25,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:07:25,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:25" (1/1) ... [2025-02-06 04:07:25,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:25" (1/1) ... [2025-02-06 04:07:25,103 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:25" (1/1) ... [2025-02-06 04:07:25,126 INFO L175 MemorySlicer]: Split 123 memory accesses to 2 slices as follows [2, 121]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 27 writes are split as follows [0, 27]. [2025-02-06 04:07:25,126 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:25" (1/1) ... [2025-02-06 04:07:25,126 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:25" (1/1) ... [2025-02-06 04:07:25,148 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:25" (1/1) ... [2025-02-06 04:07:25,152 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:25" (1/1) ... [2025-02-06 04:07:25,154 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:25" (1/1) ... [2025-02-06 04:07:25,155 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:25" (1/1) ... [2025-02-06 04:07:25,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:07:25,162 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:07:25,162 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:07:25,162 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:07:25,170 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:25" (1/1) ... [2025-02-06 04:07:25,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:07:25,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:07:25,195 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:07:25,201 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:07:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:07:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 04:07:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 04:07:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-02-06 04:07:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-02-06 04:07:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 04:07:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 04:07:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 04:07:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 04:07:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 04:07:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 04:07:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 04:07:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 04:07:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 04:07:25,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 04:07:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 04:07:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 04:07:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-02-06 04:07:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-02-06 04:07:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 04:07:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 04:07:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-02-06 04:07:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-02-06 04:07:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-02-06 04:07:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-02-06 04:07:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:07:25,214 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:07:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-02-06 04:07:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-02-06 04:07:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:07:25,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:07:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 04:07:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 04:07:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 04:07:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 04:07:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 04:07:25,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 04:07:25,318 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:07:25,319 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:07:27,080 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~ite88#1;havoc property_#t~ite85#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem92#1;havoc property_#t~mem89#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~short93#1;havoc property_#t~ite104#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short96#1;havoc property_#t~ite101#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~short105#1;havoc property_#t~mem106#1;havoc property_#t~ite131#1;havoc property_#t~mem109#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~short110#1;havoc property_#t~ite128#1;havoc property_#t~mem111#1;havoc property_#t~mem112#1;havoc property_#t~ite115#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~mem116#1;havoc property_#t~ite127#1;havoc property_#t~mem124#1;havoc property_#t~mem117#1;havoc property_#t~mem118#1;havoc property_#t~mem119#1;havoc property_#t~ite123#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~mem130#1;havoc property_#t~mem129#1;havoc property_#t~short132#1; [2025-02-06 04:07:27,141 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2025-02-06 04:07:27,141 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:07:27,149 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:07:27,149 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:07:27,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:07:27 BoogieIcfgContainer [2025-02-06 04:07:27,150 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:07:27,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:07:27,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:07:27,156 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:07:27,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:07:24" (1/3) ... [2025-02-06 04:07:27,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ad2fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:07:27, skipping insertion in model container [2025-02-06 04:07:27,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:07:25" (2/3) ... [2025-02-06 04:07:27,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ad2fde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:07:27, skipping insertion in model container [2025-02-06 04:07:27,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:07:27" (3/3) ... [2025-02-06 04:07:27,158 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-7.i [2025-02-06 04:07:27,167 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:07:27,168 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-7.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 04:07:27,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:07:27,210 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;@534e314c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:07:27,211 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:07:27,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 04:07:27,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 04:07:27,219 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:27,220 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:27,220 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:27,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:27,225 INFO L85 PathProgramCache]: Analyzing trace with hash 522045798, now seen corresponding path program 1 times [2025-02-06 04:07:27,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:07:27,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146736624] [2025-02-06 04:07:27,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:27,234 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:07:27,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:07:27,236 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:07:27,238 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:07:27,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 04:07:27,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 04:07:27,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:27,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:27,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:07:27,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:27,600 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-02-06 04:07:27,601 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:07:27,602 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:07:27,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2146736624] [2025-02-06 04:07:27,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2146736624] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:27,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:27,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:07:27,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684780548] [2025-02-06 04:07:27,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:27,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:07:27,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:07:27,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:07:27,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:07:27,626 INFO L87 Difference]: Start difference. First operand has 99 states, 84 states have (on average 1.4642857142857142) internal successors, (123), 85 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 04:07:27,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:27,648 INFO L93 Difference]: Finished difference Result 192 states and 301 transitions. [2025-02-06 04:07:27,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:07:27,650 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 103 [2025-02-06 04:07:27,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:27,654 INFO L225 Difference]: With dead ends: 192 [2025-02-06 04:07:27,654 INFO L226 Difference]: Without dead ends: 96 [2025-02-06 04:07:27,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 102 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:07:27,658 INFO L435 NwaCegarLoop]: 138 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, 138 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:07:27,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:07:27,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-06 04:07:27,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-06 04:07:27,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 82 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 04:07:27,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2025-02-06 04:07:27,690 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 103 [2025-02-06 04:07:27,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:27,690 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2025-02-06 04:07:27,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 04:07:27,690 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2025-02-06 04:07:27,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-02-06 04:07:27,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:27,693 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:27,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-02-06 04:07:27,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:07:27,894 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:27,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:27,894 INFO L85 PathProgramCache]: Analyzing trace with hash 890768734, now seen corresponding path program 1 times [2025-02-06 04:07:27,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:07:27,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [292639049] [2025-02-06 04:07:27,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:27,895 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:07:27,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:07:27,898 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:07:27,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-02-06 04:07:28,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-02-06 04:07:28,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-02-06 04:07:28,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:28,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:28,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 04:07:28,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:28,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-02-06 04:07:28,364 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-06 04:07:28,367 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:07:28,367 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:07:28,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [292639049] [2025-02-06 04:07:28,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [292639049] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:28,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:28,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:07:28,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962167796] [2025-02-06 04:07:28,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:28,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:07:28,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:07:28,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:07:28,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:07:28,369 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 04:07:30,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:30,497 INFO L93 Difference]: Finished difference Result 190 states and 274 transitions. [2025-02-06 04:07:30,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:07:30,498 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 103 [2025-02-06 04:07:30,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:30,501 INFO L225 Difference]: With dead ends: 190 [2025-02-06 04:07:30,501 INFO L226 Difference]: Without dead ends: 97 [2025-02-06 04:07:30,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:07:30,502 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 133 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:30,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 381 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-06 04:07:30,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-06 04:07:30,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2025-02-06 04:07:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.3780487804878048) internal successors, (113), 82 states have internal predecessors, (113), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 04:07:30,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 137 transitions. [2025-02-06 04:07:30,510 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 137 transitions. Word has length 103 [2025-02-06 04:07:30,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:30,510 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 137 transitions. [2025-02-06 04:07:30,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-06 04:07:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 137 transitions. [2025-02-06 04:07:30,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-02-06 04:07:30,511 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:30,511 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:30,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-02-06 04:07:30,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:07:30,712 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:30,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:30,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1975863456, now seen corresponding path program 1 times [2025-02-06 04:07:30,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:07:30,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174133177] [2025-02-06 04:07:30,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:30,713 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:07:30,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:07:30,715 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:07:30,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-02-06 04:07:30,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 04:07:31,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 04:07:31,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:31,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:31,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 04:07:31,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:31,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2025-02-06 04:07:31,118 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-06 04:07:31,119 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:07:31,119 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:07:31,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174133177] [2025-02-06 04:07:31,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1174133177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:07:31,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:07:31,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:07:31,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893690949] [2025-02-06 04:07:31,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:07:31,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:07:31,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:07:31,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:07:31,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:07:31,122 INFO L87 Difference]: Start difference. First operand 96 states and 137 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 04:07:33,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:07:33,438 INFO L93 Difference]: Finished difference Result 190 states and 272 transitions. [2025-02-06 04:07:33,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:07:33,438 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2025-02-06 04:07:33,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:07:33,439 INFO L225 Difference]: With dead ends: 190 [2025-02-06 04:07:33,439 INFO L226 Difference]: Without dead ends: 97 [2025-02-06 04:07:33,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:07:33,441 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 120 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-06 04:07:33,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 376 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-06 04:07:33,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-06 04:07:33,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2025-02-06 04:07:33,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-06 04:07:33,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 136 transitions. [2025-02-06 04:07:33,447 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 136 transitions. Word has length 105 [2025-02-06 04:07:33,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:07:33,448 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 136 transitions. [2025-02-06 04:07:33,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-06 04:07:33,448 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2025-02-06 04:07:33,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 04:07:33,449 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:07:33,449 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:33,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-06 04:07:33,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:07:33,650 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:07:33,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:07:33,650 INFO L85 PathProgramCache]: Analyzing trace with hash -94429090, now seen corresponding path program 1 times [2025-02-06 04:07:33,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:07:33,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246817536] [2025-02-06 04:07:33,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:33,651 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:07:33,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:07:33,654 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:07:33,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-02-06 04:07:33,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 04:07:34,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 04:07:34,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:34,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:34,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 04:07:34,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:35,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 04:07:35,498 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:07:35,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-02-06 04:07:36,528 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 24 treesize of output 12 [2025-02-06 04:07:36,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2025-02-06 04:07:40,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 50 [2025-02-06 04:07:40,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 61 [2025-02-06 04:07:42,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 73 [2025-02-06 04:07:42,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:07:42,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 99 treesize of output 51 [2025-02-06 04:07:42,611 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 120 proven. 44 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-06 04:07:42,611 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:07:43,780 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:07:43,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246817536] [2025-02-06 04:07:43,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246817536] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:07:43,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [736116433] [2025-02-06 04:07:43,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:07:43,780 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-02-06 04:07:43,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-02-06 04:07:43,782 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-02-06 04:07:43,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-02-06 04:07:43,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 04:07:45,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 04:07:45,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:07:45,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:07:45,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-06 04:07:45,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:07:46,150 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:07:46,428 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:07:46,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-02-06 04:07:49,471 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 24 treesize of output 12 [2025-02-06 04:07:49,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2025-02-06 04:07:54,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 39 [2025-02-06 04:08:03,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 58 [2025-02-06 04:08:09,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 73 [2025-02-06 04:08:12,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 51 [2025-02-06 04:08:12,412 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 120 proven. 44 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-02-06 04:08:12,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:08:13,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [736116433] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:08:13,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 04:08:13,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-02-06 04:08:13,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475627048] [2025-02-06 04:08:13,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 04:08:13,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 04:08:13,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:08:13,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 04:08:13,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=337, Unknown=11, NotChecked=0, Total=420 [2025-02-06 04:08:13,089 INFO L87 Difference]: Start difference. First operand 96 states and 136 transitions. Second operand has 16 states, 16 states have (on average 6.5) internal successors, (104), 15 states have internal predecessors, (104), 6 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 6 states have call predecessors, (24), 6 states have call successors, (24) [2025-02-06 04:08:21,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 04:08:25,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 04:08:35,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 04:08:38,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 04:08:40,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 04:08:42,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 04:08:46,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]