./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-41.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-41.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 04b38c43cf073d5761881699daea2b308f88de8b23c10c1f9d287e3c6a7f4942 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:03:21,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:03:21,907 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:03:21,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:03:21,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:03:21,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:03:21,929 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:03:21,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:03:21,929 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:03:21,929 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:03:21,930 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:03:21,930 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:03:21,930 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:03:21,930 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:03:21,930 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:03:21,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:03:21,930 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:03:21,930 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:03:21,930 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 04:03:21,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:03:21,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:03:21,931 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:03:21,931 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:03:21,931 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:03:21,931 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:03:21,931 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:03:21,931 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:03:21,931 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:03:21,931 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:03:21,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:03:21,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:03:21,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:03:21,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:03:21,932 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:03:21,932 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:03:21,932 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:03:21,932 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:03:21,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 04:03:21,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 04:03:21,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:03:21,932 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:03:21,932 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:03:21,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:03:21,933 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 -> 04b38c43cf073d5761881699daea2b308f88de8b23c10c1f9d287e3c6a7f4942 [2025-02-06 04:03:22,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:03:22,189 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:03:22,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:03:22,192 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:03:22,192 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:03:22,193 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-41.i [2025-02-06 04:03:23,461 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3920f788f/595e8d115a774c6faad337352e4ea1b5/FLAG0e36f9ee2 [2025-02-06 04:03:23,809 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:03:23,809 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-41.i [2025-02-06 04:03:23,816 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3920f788f/595e8d115a774c6faad337352e4ea1b5/FLAG0e36f9ee2 [2025-02-06 04:03:24,053 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3920f788f/595e8d115a774c6faad337352e4ea1b5 [2025-02-06 04:03:24,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:03:24,056 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:03:24,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:03:24,057 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:03:24,060 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:03:24,060 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:03:24" (1/1) ... [2025-02-06 04:03:24,061 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5972b94f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:24, skipping insertion in model container [2025-02-06 04:03:24,061 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:03:24" (1/1) ... [2025-02-06 04:03:24,082 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:03:24,160 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-41.i[917,930] [2025-02-06 04:03:24,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:03:24,199 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:03:24,207 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-41.i[917,930] [2025-02-06 04:03:24,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:03:24,249 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:03:24,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:24 WrapperNode [2025-02-06 04:03:24,250 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:03:24,250 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:03:24,250 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:03:24,250 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:03:24,254 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:03:24" (1/1) ... [2025-02-06 04:03:24,261 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:03:24" (1/1) ... [2025-02-06 04:03:24,285 INFO L138 Inliner]: procedures = 30, calls = 137, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 407 [2025-02-06 04:03:24,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:03:24,286 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:03:24,286 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:03:24,286 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:03:24,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:24" (1/1) ... [2025-02-06 04:03:24,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:24" (1/1) ... [2025-02-06 04:03:24,303 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:24" (1/1) ... [2025-02-06 04:03:24,309 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-02-06 04:03:24,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:24" (1/1) ... [2025-02-06 04:03:24,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:24" (1/1) ... [2025-02-06 04:03:24,322 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:24" (1/1) ... [2025-02-06 04:03:24,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:24" (1/1) ... [2025-02-06 04:03:24,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:24" (1/1) ... [2025-02-06 04:03:24,331 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:24" (1/1) ... [2025-02-06 04:03:24,333 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:03:24,337 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:03:24,337 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:03:24,337 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:03:24,338 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:24" (1/1) ... [2025-02-06 04:03:24,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:03:24,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:03:24,368 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:03:24,369 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:03:24,389 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:03:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-02-06 04:03:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-02-06 04:03:24,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-02-06 04:03:24,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 04:03:24,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-02-06 04:03:24,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 04:03:24,392 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:03:24,392 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:03:24,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 04:03:24,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:03:24,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:03:24,512 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:03:24,515 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:03:24,801 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L124: havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~ite75#1;havoc property_#t~mem63#1;havoc property_#t~ite72#1;havoc property_#t~mem66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~mem71#1;havoc property_#t~mem67#1;havoc property_#t~ite70#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem74#1;havoc property_#t~mem73#1;havoc property_#t~mem76#1;havoc property_#t~ite89#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~short83#1;havoc property_#t~ite88#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~short90#1;havoc property_#t~mem92#1;havoc property_#t~mem91#1;havoc property_#t~short93#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short97#1;havoc property_#t~ite102#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short108#1; [2025-02-06 04:03:24,846 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2025-02-06 04:03:24,846 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:03:24,860 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:03:24,861 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:03:24,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:03:24 BoogieIcfgContainer [2025-02-06 04:03:24,862 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:03:24,863 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:03:24,863 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:03:24,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:03:24,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:03:24" (1/3) ... [2025-02-06 04:03:24,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697c39b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:03:24, skipping insertion in model container [2025-02-06 04:03:24,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:24" (2/3) ... [2025-02-06 04:03:24,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697c39b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:03:24, skipping insertion in model container [2025-02-06 04:03:24,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:03:24" (3/3) ... [2025-02-06 04:03:24,869 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-41.i [2025-02-06 04:03:24,879 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:03:24,880 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-41.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 04:03:24,921 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:03:24,934 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;@29c96112, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:03:24,934 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:03:24,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 72 states have internal predecessors, (99), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 04:03:24,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 04:03:24,947 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:24,947 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:03:24,948 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:24,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:24,952 INFO L85 PathProgramCache]: Analyzing trace with hash -2054680467, now seen corresponding path program 1 times [2025-02-06 04:03:24,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:24,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146842897] [2025-02-06 04:03:24,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:24,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:25,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 04:03:25,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 04:03:25,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:25,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:25,217 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-06 04:03:25,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:25,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146842897] [2025-02-06 04:03:25,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146842897] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 04:03:25,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179581279] [2025-02-06 04:03:25,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:25,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 04:03:25,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:03:25,220 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:03:25,222 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:03:25,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 04:03:25,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 04:03:25,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:25,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:25,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:03:25,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:03:25,424 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-02-06 04:03:25,426 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:03:25,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179581279] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:25,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:03:25,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 04:03:25,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084283394] [2025-02-06 04:03:25,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:25,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:03:25,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:25,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:03:25,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:03:25,448 INFO L87 Difference]: Start difference. First operand has 88 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 72 states have internal predecessors, (99), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 04:03:25,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:25,467 INFO L93 Difference]: Finished difference Result 166 states and 257 transitions. [2025-02-06 04:03:25,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:03:25,470 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2025-02-06 04:03:25,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:25,475 INFO L225 Difference]: With dead ends: 166 [2025-02-06 04:03:25,475 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 04:03:25,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 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:03:25,481 INFO L435 NwaCegarLoop]: 115 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, 115 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:03:25,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:03:25,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 04:03:25,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-06 04:03:25,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 04:03:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2025-02-06 04:03:25,516 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 114 [2025-02-06 04:03:25,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:25,516 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2025-02-06 04:03:25,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 04:03:25,516 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2025-02-06 04:03:25,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 04:03:25,519 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:25,519 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:03:25,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 04:03:25,722 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:03:25,722 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:25,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:25,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1435869841, now seen corresponding path program 1 times [2025-02-06 04:03:25,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:25,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589589164] [2025-02-06 04:03:25,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:25,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:25,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 04:03:25,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 04:03:25,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:25,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:26,079 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 04:03:26,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:26,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589589164] [2025-02-06 04:03:26,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589589164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:26,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:26,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 04:03:26,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327216788] [2025-02-06 04:03:26,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:26,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 04:03:26,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:26,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 04:03:26,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 04:03:26,081 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 04:03:26,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:26,130 INFO L93 Difference]: Finished difference Result 162 states and 231 transitions. [2025-02-06 04:03:26,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 04:03:26,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2025-02-06 04:03:26,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:26,131 INFO L225 Difference]: With dead ends: 162 [2025-02-06 04:03:26,132 INFO L226 Difference]: Without dead ends: 84 [2025-02-06 04:03:26,132 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:03:26,132 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 1 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:26,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 325 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:03:26,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-06 04:03:26,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2025-02-06 04:03:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.328358208955224) internal successors, (89), 67 states have internal predecessors, (89), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 04:03:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2025-02-06 04:03:26,139 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 114 [2025-02-06 04:03:26,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:26,155 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2025-02-06 04:03:26,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 04:03:26,155 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2025-02-06 04:03:26,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 04:03:26,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:26,157 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:03:26,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 04:03:26,157 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:26,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:26,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1051642992, now seen corresponding path program 1 times [2025-02-06 04:03:26,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:26,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703432135] [2025-02-06 04:03:26,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:26,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:26,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 04:03:26,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 04:03:26,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:26,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:26,684 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 04:03:26,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:26,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703432135] [2025-02-06 04:03:26,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703432135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:26,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:26,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 04:03:26,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657071512] [2025-02-06 04:03:26,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:26,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:03:26,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:26,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:03:26,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:03:26,686 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 04:03:26,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:26,928 INFO L93 Difference]: Finished difference Result 191 states and 269 transitions. [2025-02-06 04:03:26,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 04:03:26,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2025-02-06 04:03:26,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:26,931 INFO L225 Difference]: With dead ends: 191 [2025-02-06 04:03:26,931 INFO L226 Difference]: Without dead ends: 111 [2025-02-06 04:03:26,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:03:26,932 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 120 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:26,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 378 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 04:03:26,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-06 04:03:26,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 87. [2025-02-06 04:03:26,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 71 states have internal predecessors, (93), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 04:03:26,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 121 transitions. [2025-02-06 04:03:26,940 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 121 transitions. Word has length 114 [2025-02-06 04:03:26,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:26,940 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 121 transitions. [2025-02-06 04:03:26,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 04:03:26,941 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 121 transitions. [2025-02-06 04:03:26,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-06 04:03:26,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:26,942 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:03:26,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 04:03:26,942 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:26,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:26,942 INFO L85 PathProgramCache]: Analyzing trace with hash 923187761, now seen corresponding path program 1 times [2025-02-06 04:03:26,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:26,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695566661] [2025-02-06 04:03:26,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:26,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:26,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 04:03:27,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 04:03:27,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:27,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:27,147 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 04:03:27,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 04:03:27,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695566661] [2025-02-06 04:03:27,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695566661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:27,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:27,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:03:27,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311963039] [2025-02-06 04:03:27,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:27,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:03:27,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 04:03:27,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:03:27,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:03:27,149 INFO L87 Difference]: Start difference. First operand 87 states and 121 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 04:03:27,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:27,161 INFO L93 Difference]: Finished difference Result 162 states and 227 transitions. [2025-02-06 04:03:27,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:03:27,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 115 [2025-02-06 04:03:27,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:27,163 INFO L225 Difference]: With dead ends: 162 [2025-02-06 04:03:27,163 INFO L226 Difference]: Without dead ends: 78 [2025-02-06 04:03:27,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:03:27,166 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:27,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:03:27,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-06 04:03:27,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-02-06 04:03:27,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 62 states have internal predecessors, (80), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 04:03:27,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 108 transitions. [2025-02-06 04:03:27,176 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 108 transitions. Word has length 115 [2025-02-06 04:03:27,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:27,177 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 108 transitions. [2025-02-06 04:03:27,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 04:03:27,177 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 108 transitions. [2025-02-06 04:03:27,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 04:03:27,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:27,198 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:03:27,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 04:03:27,199 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:27,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:27,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1893224883, now seen corresponding path program 1 times [2025-02-06 04:03:27,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 04:03:27,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507171123] [2025-02-06 04:03:27,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:27,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 04:03:27,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 04:03:27,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 04:03:27,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:27,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:03:27,346 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 04:03:27,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 04:03:27,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 04:03:27,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:27,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 04:03:27,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 04:03:27,619 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 04:03:27,620 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 04:03:27,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 04:03:27,625 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-02-06 04:03:27,727 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 04:03:27,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 04:03:27 BoogieIcfgContainer [2025-02-06 04:03:27,729 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 04:03:27,730 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 04:03:27,730 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 04:03:27,730 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 04:03:27,731 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:03:24" (3/4) ... [2025-02-06 04:03:27,732 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 04:03:27,733 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 04:03:27,734 INFO L158 Benchmark]: Toolchain (without parser) took 3677.54ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 134.1MB in the beginning and 105.4MB in the end (delta: 28.8MB). Peak memory consumption was 93.3MB. Max. memory is 16.1GB. [2025-02-06 04:03:27,734 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:03:27,734 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.82ms. Allocated memory is still 167.8MB. Free memory was 134.1MB in the beginning and 118.9MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 04:03:27,734 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.58ms. Allocated memory is still 167.8MB. Free memory was 118.9MB in the beginning and 116.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:03:27,734 INFO L158 Benchmark]: Boogie Preprocessor took 48.31ms. Allocated memory is still 167.8MB. Free memory was 116.1MB in the beginning and 113.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:03:27,735 INFO L158 Benchmark]: IcfgBuilder took 524.80ms. Allocated memory is still 167.8MB. Free memory was 113.5MB in the beginning and 84.2MB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-02-06 04:03:27,735 INFO L158 Benchmark]: TraceAbstraction took 2866.35ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 83.4MB in the beginning and 105.4MB in the end (delta: -22.1MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2025-02-06 04:03:27,735 INFO L158 Benchmark]: Witness Printer took 3.06ms. Allocated memory is still 234.9MB. Free memory was 105.4MB in the beginning and 105.4MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 04:03:27,736 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.23ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.82ms. Allocated memory is still 167.8MB. Free memory was 134.1MB in the beginning and 118.9MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.58ms. Allocated memory is still 167.8MB. Free memory was 118.9MB in the beginning and 116.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.31ms. Allocated memory is still 167.8MB. Free memory was 116.1MB in the beginning and 113.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 524.80ms. Allocated memory is still 167.8MB. Free memory was 113.5MB in the beginning and 84.2MB in the end (delta: 29.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2866.35ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 83.4MB in the beginning and 105.4MB in the end (delta: -22.1MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. * Witness Printer took 3.06ms. Allocated memory is still 234.9MB. Free memory was 105.4MB in the beginning and 105.4MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 124, overapproximation of someBinaryDOUBLEComparisonOperation at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 111. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -16, 0, -8, 5, 2, 0, 8.5, 999999999999.6, 10, -1, 16, 64 }; [L51] signed char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L52] unsigned char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L53] signed char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L54] signed char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L55] unsigned short int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L56] unsigned char* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L57] double* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L58] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L59] signed long int* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L60] signed char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L61] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L62] unsigned char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L63] signed char last_1_WrapperStruct00_var_1_1 = -16; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=0, last_1_WrapperStruct00_var_1_1=-16] [L128] isInitial = 1 [L129] FCALL initially() [L130] COND TRUE 1 [L131] CALL updateLastVariables() [L121] EXPR WrapperStruct00.var_1_1 [L121] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L131] RET updateLastVariables() [L132] CALL updateVariables() [L98] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L100] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L101] WrapperStruct00.var_1_6 = __VERIFIER_nondet_char() [L102] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= -31) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= -31) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L103] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 31) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 31) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L104] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L105] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L106] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 63) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L107] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L108] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L109] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L110] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L111] EXPR WrapperStruct00.var_1_13 [L111] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L111] EXPR WrapperStruct00.var_1_13 [L111] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L111] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L111] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L111] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L112] WrapperStruct00.var_1_15 = __VERIFIER_nondet_char() [L113] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= -128) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= -128) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L114] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L115] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_15 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_15 != 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L116] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L117] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L118] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L132] RET updateVariables() [L133] CALL step() [L67] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L67] COND TRUE (*(WrapperStruct00_var_1_5_Pointer)) && (last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) [L68] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L68] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_17_Pointer)) [L70] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L70] (*(WrapperStruct00_var_1_12_Pointer)) = ((*(WrapperStruct00_var_1_13_Pointer)) - 8.3) [L71] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L71] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L71] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_13_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer)); [L72] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16, stepLocal_1=1] [L72] COND TRUE (*(WrapperStruct00_var_1_5_Pointer)) && stepLocal_1 [L73] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L73] (*(WrapperStruct00_var_1_14_Pointer)) = (*(WrapperStruct00_var_1_16_Pointer)) [L77] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L77] COND TRUE (*(WrapperStruct00_var_1_5_Pointer)) [L78] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L78] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L78] (*(WrapperStruct00_var_1_8_Pointer)) = ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))) [L86] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L86] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L86] unsigned long int stepLocal_0 = ((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer)); [L87] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16, stepLocal_0=0] [L87] COND FALSE !(stepLocal_0 > (*(WrapperStruct00_var_1_8_Pointer))) [L94] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L94] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_6_Pointer)) [L133] RET step() [L134] CALL, EXPR property() [L124] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L124] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L124] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L124] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer)))) [L124] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L124] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L124] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L124] EXPR (((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))))) [L124] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L124] EXPR (*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer))))) [L124] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L124] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L124] EXPR \read(*WrapperStruct00_var_1_16_Pointer) [L124] EXPR (*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L124] EXPR (((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L124] EXPR ((((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) - 8.3))) [L124] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L124] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L124] EXPR ((((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) - 8.3))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L124] EXPR (((((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) - 8.3)))) && (((*(WrapperStruct00_var_1_5_Pointer)) && ((*(WrapperStruct00_var_1_13_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_15_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L124] EXPR ((((((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) - 8.3)))) && (((*(WrapperStruct00_var_1_5_Pointer)) && ((*(WrapperStruct00_var_1_13_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_15_Pointer)))))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer)))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L124-L125] return ((((((((*(WrapperStruct00_var_1_8_Pointer)) & 0u) * (*(WrapperStruct00_var_1_16_Pointer))) > (*(WrapperStruct00_var_1_8_Pointer))) ? ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((16 + (*(WrapperStruct00_var_1_6_Pointer))) + (*(WrapperStruct00_var_1_7_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((*(WrapperStruct00_var_1_6_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_6_Pointer))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_6_Pointer))))) && ((*(WrapperStruct00_var_1_5_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) ((*(WrapperStruct00_var_1_16_Pointer)) + (*(WrapperStruct00_var_1_16_Pointer))))) : ((((*(WrapperStruct00_var_1_16_Pointer)) > (*(WrapperStruct00_var_1_14_Pointer))) || (*(WrapperStruct00_var_1_11_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned short int) (*(WrapperStruct00_var_1_16_Pointer))))))) && ((*(WrapperStruct00_var_1_12_Pointer)) == ((double) ((*(WrapperStruct00_var_1_13_Pointer)) - 8.3)))) && (((*(WrapperStruct00_var_1_5_Pointer)) && ((*(WrapperStruct00_var_1_13_Pointer)) >= (*(WrapperStruct00_var_1_12_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_16_Pointer)))) : ((*(WrapperStruct00_var_1_14_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_15_Pointer)))))) && (((*(WrapperStruct00_var_1_5_Pointer)) && (last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1)) ? ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer)))) : 1) ; [L134] RET, EXPR property() [L134] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_11_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:7}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:23}, WrapperStruct00_var_1_15_Pointer={4:27}, WrapperStruct00_var_1_16_Pointer={4:28}, WrapperStruct00_var_1_17_Pointer={4:29}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_5_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 5, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 121 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 1029 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 578 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 176 IncrementalHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 451 mSDtfsCounter, 176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=88occurred in iteration=0, InterpolantAutomatonStates: 15, 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, 25 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 566 ConstructedInterpolants, 0 QuantifiedInterpolants, 904 SizeOfPredicates, 0 NumberOfNonLiveVariables, 476 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 1794/1820 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:03:27,761 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-41.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 04b38c43cf073d5761881699daea2b308f88de8b23c10c1f9d287e3c6a7f4942 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 04:03:29,763 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 04:03:29,854 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:03:29,859 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 04:03:29,861 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 04:03:29,879 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 04:03:29,880 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 04:03:29,880 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 04:03:29,880 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 04:03:29,880 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 04:03:29,881 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 04:03:29,881 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 04:03:29,881 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 04:03:29,881 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 04:03:29,881 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 04:03:29,881 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 04:03:29,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 04:03:29,881 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 04:03:29,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 04:03:29,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 04:03:29,882 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 04:03:29,882 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 04:03:29,882 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 04:03:29,882 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 04:03:29,882 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 04:03:29,882 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 04:03:29,882 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 04:03:29,882 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 04:03:29,882 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 04:03:29,882 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 04:03:29,883 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 04:03:29,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 04:03:29,883 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 04:03:29,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 04:03:29,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:03:29,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 04:03:29,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 04:03:29,883 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 04:03:29,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 04:03:29,883 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 04:03:29,883 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 04:03:29,883 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 04:03:29,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 04:03:29,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 04:03:29,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 04:03:29,884 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 -> 04b38c43cf073d5761881699daea2b308f88de8b23c10c1f9d287e3c6a7f4942 [2025-02-06 04:03:30,153 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 04:03:30,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 04:03:30,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 04:03:30,174 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 04:03:30,174 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 04:03:30,175 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-41.i [2025-02-06 04:03:31,559 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf344f3f1/0cd7c48ace8041dbb5f84703639212df/FLAG3b13aad7a [2025-02-06 04:03:31,763 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 04:03:31,764 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-41.i [2025-02-06 04:03:31,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf344f3f1/0cd7c48ace8041dbb5f84703639212df/FLAG3b13aad7a [2025-02-06 04:03:31,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cf344f3f1/0cd7c48ace8041dbb5f84703639212df [2025-02-06 04:03:31,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 04:03:31,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 04:03:31,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 04:03:31,790 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 04:03:31,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 04:03:31,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:03:31" (1/1) ... [2025-02-06 04:03:31,793 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55d3da6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:31, skipping insertion in model container [2025-02-06 04:03:31,793 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 04:03:31" (1/1) ... [2025-02-06 04:03:31,808 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 04:03:31,906 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-41.i[917,930] [2025-02-06 04:03:31,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:03:31,979 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 04:03:31,987 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-41.i[917,930] [2025-02-06 04:03:32,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 04:03:32,032 INFO L204 MainTranslator]: Completed translation [2025-02-06 04:03:32,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:32 WrapperNode [2025-02-06 04:03:32,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 04:03:32,034 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 04:03:32,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 04:03:32,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 04:03:32,039 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:03:32" (1/1) ... [2025-02-06 04:03:32,050 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:03:32" (1/1) ... [2025-02-06 04:03:32,081 INFO L138 Inliner]: procedures = 37, calls = 137, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 403 [2025-02-06 04:03:32,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 04:03:32,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 04:03:32,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 04:03:32,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 04:03:32,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:32" (1/1) ... [2025-02-06 04:03:32,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:32" (1/1) ... [2025-02-06 04:03:32,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:32" (1/1) ... [2025-02-06 04:03:32,121 INFO L175 MemorySlicer]: Split 112 memory accesses to 2 slices as follows [2, 110]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 30 writes are split as follows [0, 30]. [2025-02-06 04:03:32,122 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:32" (1/1) ... [2025-02-06 04:03:32,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:32" (1/1) ... [2025-02-06 04:03:32,140 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:32" (1/1) ... [2025-02-06 04:03:32,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:32" (1/1) ... [2025-02-06 04:03:32,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:32" (1/1) ... [2025-02-06 04:03:32,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:32" (1/1) ... [2025-02-06 04:03:32,151 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 04:03:32,155 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 04:03:32,155 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 04:03:32,155 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 04:03:32,156 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:32" (1/1) ... [2025-02-06 04:03:32,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 04:03:32,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 04:03:32,183 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:03:32,188 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:03:32,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 04:03:32,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-02-06 04:03:32,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-02-06 04:03:32,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-02-06 04:03:32,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-02-06 04:03:32,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-02-06 04:03:32,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-02-06 04:03:32,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 04:03:32,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 04:03:32,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 04:03:32,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 04:03:32,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 04:03:32,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 04:03:32,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 04:03:32,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 04:03:32,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-02-06 04:03:32,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-02-06 04:03:32,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2025-02-06 04:03:32,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2025-02-06 04:03:32,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-02-06 04:03:32,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-02-06 04:03:32,206 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 04:03:32,206 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 04:03:32,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 04:03:32,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 04:03:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 04:03:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 04:03:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 04:03:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 04:03:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 04:03:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 04:03:32,325 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 04:03:32,327 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 04:03:33,218 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L124: havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~ite75#1;havoc property_#t~mem63#1;havoc property_#t~ite72#1;havoc property_#t~mem66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~mem71#1;havoc property_#t~mem67#1;havoc property_#t~ite70#1;havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem74#1;havoc property_#t~mem73#1;havoc property_#t~mem76#1;havoc property_#t~ite89#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~short83#1;havoc property_#t~ite88#1;havoc property_#t~mem85#1;havoc property_#t~mem84#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~short90#1;havoc property_#t~mem92#1;havoc property_#t~mem91#1;havoc property_#t~short93#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short97#1;havoc property_#t~ite102#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~mem101#1;havoc property_#t~mem100#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~short108#1; [2025-02-06 04:03:33,245 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2025-02-06 04:03:33,245 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 04:03:33,254 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 04:03:33,255 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 04:03:33,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:03:33 BoogieIcfgContainer [2025-02-06 04:03:33,256 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 04:03:33,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 04:03:33,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 04:03:33,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 04:03:33,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 04:03:31" (1/3) ... [2025-02-06 04:03:33,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545673e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:03:33, skipping insertion in model container [2025-02-06 04:03:33,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 04:03:32" (2/3) ... [2025-02-06 04:03:33,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545673e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 04:03:33, skipping insertion in model container [2025-02-06 04:03:33,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 04:03:33" (3/3) ... [2025-02-06 04:03:33,294 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-41.i [2025-02-06 04:03:33,303 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 04:03:33,304 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-41.i that has 2 procedures, 88 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 04:03:33,340 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 04:03:33,346 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;@404cfbe6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 04:03:33,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 04:03:33,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 72 states have internal predecessors, (99), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 04:03:33,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 04:03:33,355 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:33,356 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:03:33,356 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:33,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:33,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1589906888, now seen corresponding path program 1 times [2025-02-06 04:03:33,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:03:33,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726347587] [2025-02-06 04:03:33,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:33,367 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:03:33,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:03:33,368 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:03:33,372 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:03:33,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 04:03:33,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 04:03:33,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:33,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:33,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 04:03:33,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:03:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-02-06 04:03:33,686 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:03:33,686 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:03:33,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726347587] [2025-02-06 04:03:33,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1726347587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:33,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:33,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 04:03:33,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188138873] [2025-02-06 04:03:33,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:33,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 04:03:33,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:03:33,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 04:03:33,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:03:33,703 INFO L87 Difference]: Start difference. First operand has 88 states, 71 states have (on average 1.3943661971830985) internal successors, (99), 72 states have internal predecessors, (99), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 04:03:33,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:33,718 INFO L93 Difference]: Finished difference Result 166 states and 257 transitions. [2025-02-06 04:03:33,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 04:03:33,719 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2025-02-06 04:03:33,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:33,723 INFO L225 Difference]: With dead ends: 166 [2025-02-06 04:03:33,723 INFO L226 Difference]: Without dead ends: 81 [2025-02-06 04:03:33,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 04:03:33,727 INFO L435 NwaCegarLoop]: 115 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, 115 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:03:33,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:03:33,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-06 04:03:33,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-02-06 04:03:33,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 65 states have internal predecessors, (87), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 04:03:33,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2025-02-06 04:03:33,755 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 114 [2025-02-06 04:03:33,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:33,755 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2025-02-06 04:03:33,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 04:03:33,755 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2025-02-06 04:03:33,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-02-06 04:03:33,761 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:33,762 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:03:33,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-02-06 04:03:33,966 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:03:33,966 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:33,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:33,967 INFO L85 PathProgramCache]: Analyzing trace with hash -2086249782, now seen corresponding path program 1 times [2025-02-06 04:03:33,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:03:33,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558056662] [2025-02-06 04:03:33,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:33,970 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:03:33,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:03:33,973 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:03:33,974 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:03:34,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 04:03:34,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 04:03:34,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:34,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:34,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 04:03:34,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:03:34,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:03:34,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 65 [2025-02-06 04:03:34,491 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2025-02-06 04:03:34,491 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:03:34,491 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:03:34,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558056662] [2025-02-06 04:03:34,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558056662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:34,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:34,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 04:03:34,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972763237] [2025-02-06 04:03:34,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:34,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 04:03:34,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:03:34,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 04:03:34,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 04:03:34,497 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 04:03:35,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:35,406 INFO L93 Difference]: Finished difference Result 160 states and 228 transitions. [2025-02-06 04:03:35,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:03:35,409 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2025-02-06 04:03:35,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:35,410 INFO L225 Difference]: With dead ends: 160 [2025-02-06 04:03:35,410 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 04:03:35,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 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:03:35,411 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 83 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:35,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 342 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-06 04:03:35,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 04:03:35,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2025-02-06 04:03:35,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.323076923076923) internal successors, (86), 65 states have internal predecessors, (86), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 04:03:35,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 114 transitions. [2025-02-06 04:03:35,417 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 114 transitions. Word has length 114 [2025-02-06 04:03:35,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:35,418 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 114 transitions. [2025-02-06 04:03:35,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-02-06 04:03:35,418 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 114 transitions. [2025-02-06 04:03:35,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-02-06 04:03:35,419 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:35,419 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:03:35,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-02-06 04:03:35,620 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:03:35,620 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:35,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:35,620 INFO L85 PathProgramCache]: Analyzing trace with hash -849881208, now seen corresponding path program 1 times [2025-02-06 04:03:35,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:03:35,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085688676] [2025-02-06 04:03:35,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:35,621 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:03:35,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:03:35,623 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:03:35,625 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:03:35,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 04:03:36,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 04:03:36,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:36,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:36,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-06 04:03:36,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:03:36,972 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:03:38,339 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 31 treesize of output 26 [2025-02-06 04:03:39,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2025-02-06 04:03:40,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2025-02-06 04:03:43,240 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 55 treesize of output 59 [2025-02-06 04:03:44,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 70 [2025-02-06 04:03:45,699 INFO L349 Elim1Store]: treesize reduction 91, result has 14.2 percent of original size [2025-02-06 04:03:45,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 76 treesize of output 97 [2025-02-06 04:03:45,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 36 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 93 [2025-02-06 04:03:48,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 96 [2025-02-06 04:03:50,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 109 [2025-02-06 04:03:50,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 121 [2025-02-06 04:03:50,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:03:50,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 146 treesize of output 78 [2025-02-06 04:03:50,798 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 190 proven. 144 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-06 04:03:50,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 04:03:50,972 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 04:03:50,973 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:03:50,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085688676] [2025-02-06 04:03:50,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085688676] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 04:03:50,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 04:03:50,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [22] total 25 [2025-02-06 04:03:50,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569025906] [2025-02-06 04:03:50,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:50,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 04:03:50,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:03:50,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 04:03:50,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=513, Unknown=3, NotChecked=0, Total=600 [2025-02-06 04:03:50,974 INFO L87 Difference]: Start difference. First operand 81 states and 114 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 04:03:51,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:51,732 INFO L93 Difference]: Finished difference Result 187 states and 263 transitions. [2025-02-06 04:03:51,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 04:03:51,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 116 [2025-02-06 04:03:51,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:51,735 INFO L225 Difference]: With dead ends: 187 [2025-02-06 04:03:51,735 INFO L226 Difference]: Without dead ends: 109 [2025-02-06 04:03:51,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=92, Invalid=607, Unknown=3, NotChecked=0, Total=702 [2025-02-06 04:03:51,739 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 35 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:51,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 412 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 04:03:51,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-06 04:03:51,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 85. [2025-02-06 04:03:51,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 04:03:51,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 118 transitions. [2025-02-06 04:03:51,752 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 118 transitions. Word has length 116 [2025-02-06 04:03:51,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:51,752 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 118 transitions. [2025-02-06 04:03:51,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 04:03:51,752 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 118 transitions. [2025-02-06 04:03:51,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-02-06 04:03:51,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:51,754 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:03:51,765 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:03:51,954 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:03:51,954 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:51,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:51,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2105479709, now seen corresponding path program 1 times [2025-02-06 04:03:51,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:03:51,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091677473] [2025-02-06 04:03:51,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:51,956 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:03:51,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:03:51,959 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:03:51,960 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:03:52,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 04:03:52,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 04:03:52,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:52,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:52,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 04:03:52,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:03:52,206 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 04:03:52,207 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:03:52,207 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:03:52,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091677473] [2025-02-06 04:03:52,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091677473] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:52,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:52,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 04:03:52,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220182736] [2025-02-06 04:03:52,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:52,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 04:03:52,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:03:52,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 04:03:52,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:03:52,208 INFO L87 Difference]: Start difference. First operand 85 states and 118 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 04:03:52,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:52,220 INFO L93 Difference]: Finished difference Result 160 states and 223 transitions. [2025-02-06 04:03:52,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 04:03:52,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 117 [2025-02-06 04:03:52,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:52,221 INFO L225 Difference]: With dead ends: 160 [2025-02-06 04:03:52,221 INFO L226 Difference]: Without dead ends: 78 [2025-02-06 04:03:52,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 04:03:52,222 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:52,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 04:03:52,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-02-06 04:03:52,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-02-06 04:03:52,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.2741935483870968) internal successors, (79), 62 states have internal predecessors, (79), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 04:03:52,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 107 transitions. [2025-02-06 04:03:52,227 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 107 transitions. Word has length 117 [2025-02-06 04:03:52,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:52,227 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 107 transitions. [2025-02-06 04:03:52,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 04:03:52,227 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 107 transitions. [2025-02-06 04:03:52,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 04:03:52,228 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:52,228 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:03:52,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-06 04:03:52,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:03:52,433 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:52,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:52,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1409367322, now seen corresponding path program 1 times [2025-02-06 04:03:52,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:03:52,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276769904] [2025-02-06 04:03:52,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:52,434 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:03:52,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:03:52,436 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:03:52,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-06 04:03:52,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 04:03:52,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 04:03:52,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:03:52,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:03:52,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 04:03:52,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:03:54,286 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:03:54,320 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 21 treesize of output 21 [2025-02-06 04:03:54,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2025-02-06 04:03:54,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:03:54,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 42 [2025-02-06 04:03:54,459 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-02-06 04:03:54,459 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 04:03:54,459 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 04:03:54,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276769904] [2025-02-06 04:03:54,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276769904] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 04:03:54,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 04:03:54,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 04:03:54,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74233771] [2025-02-06 04:03:54,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 04:03:54,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 04:03:54,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 04:03:54,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 04:03:54,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-06 04:03:54,461 INFO L87 Difference]: Start difference. First operand 78 states and 107 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 04:03:55,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 04:03:55,481 INFO L93 Difference]: Finished difference Result 186 states and 254 transitions. [2025-02-06 04:03:55,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 04:03:55,485 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2025-02-06 04:03:55,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 04:03:55,486 INFO L225 Difference]: With dead ends: 186 [2025-02-06 04:03:55,486 INFO L226 Difference]: Without dead ends: 111 [2025-02-06 04:03:55,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-02-06 04:03:55,486 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 159 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 04:03:55,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 349 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 04:03:55,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-06 04:03:55,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 88. [2025-02-06 04:03:55,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 72 states have (on average 1.25) internal successors, (90), 72 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-06 04:03:55,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 118 transitions. [2025-02-06 04:03:55,496 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 118 transitions. Word has length 118 [2025-02-06 04:03:55,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 04:03:55,496 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 118 transitions. [2025-02-06 04:03:55,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-02-06 04:03:55,497 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 118 transitions. [2025-02-06 04:03:55,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-02-06 04:03:55,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 04:03:55,498 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 04:03:55,508 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 (6)] Forceful destruction successful, exit code 0 [2025-02-06 04:03:55,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-02-06 04:03:55,698 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 04:03:55,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 04:03:55,699 INFO L85 PathProgramCache]: Analyzing trace with hash 398087141, now seen corresponding path program 1 times [2025-02-06 04:03:55,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 04:03:55,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [219651763] [2025-02-06 04:03:55,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 04:03:55,699 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:03:55,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 04:03:55,701 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-02-06 04:03:55,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-02-06 04:03:55,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 04:04:13,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 04:04:13,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 04:04:13,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 04:04:13,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-06 04:04:13,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 04:04:15,978 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:04:17,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 61 [2025-02-06 04:04:19,309 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 107 treesize of output 72 [2025-02-06 04:04:20,451 INFO L349 Elim1Store]: treesize reduction 67, result has 18.3 percent of original size [2025-02-06 04:04:20,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 120 treesize of output 99 [2025-02-06 04:04:20,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 129 [2025-02-06 04:04:26,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 135 [2025-02-06 04:04:30,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 148 [2025-02-06 04:04:33,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 153 [2025-02-06 04:04:40,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 04:04:40,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 360 treesize of output 168 [2025-02-06 04:04:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 131 proven. 105 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2025-02-06 04:04:42,260 INFO L312 TraceCheckSpWp]: Computing backward predicates...