./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-75.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-75.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 3ea1453e8ddb919b166a2b196c485b49328495abf45a9dcbd47a0aceac1e3901 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:54:58,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:54:58,386 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:54:58,392 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:54:58,394 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:54:58,418 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:54:58,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:54:58,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:54:58,419 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:54:58,419 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:54:58,419 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:54:58,419 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:54:58,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:54:58,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:54:58,419 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:54:58,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:54:58,420 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:54:58,420 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:54:58,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:54:58,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:54:58,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:54:58,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:54:58,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:54:58,420 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:54:58,420 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:54:58,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:54:58,420 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:54:58,420 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:54:58,422 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:54:58,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:54:58,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:54:58,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:54:58,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:54:58,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:54:58,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:54:58,423 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:54:58,424 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:54:58,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:54:58,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:54:58,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:54:58,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:54:58,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:54:58,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:54:58,424 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/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 -> 3ea1453e8ddb919b166a2b196c485b49328495abf45a9dcbd47a0aceac1e3901 [2025-03-04 01:54:58,664 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:54:58,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:54:58,672 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:54:58,673 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:54:58,673 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:54:58,674 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-75.i [2025-03-04 01:54:59,762 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5c793b2/968636d484d14ceab3cd8131662ce5b9/FLAG8f8fb9b8a [2025-03-04 01:55:00,005 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:55:00,005 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-75.i [2025-03-04 01:55:00,013 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5c793b2/968636d484d14ceab3cd8131662ce5b9/FLAG8f8fb9b8a [2025-03-04 01:55:00,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f5c793b2/968636d484d14ceab3cd8131662ce5b9 [2025-03-04 01:55:00,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:55:00,326 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:55:00,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:55:00,327 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:55:00,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:55:00,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:55:00" (1/1) ... [2025-03-04 01:55:00,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@547dfb53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:00, skipping insertion in model container [2025-03-04 01:55:00,334 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:55:00" (1/1) ... [2025-03-04 01:55:00,348 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:55:00,451 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-75.i[917,930] [2025-03-04 01:55:00,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:55:00,500 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:55:00,509 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-75.i[917,930] [2025-03-04 01:55:00,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:55:00,552 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:55:00,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:00 WrapperNode [2025-03-04 01:55:00,553 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:55:00,554 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:55:00,554 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:55:00,554 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:55:00,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:00" (1/1) ... [2025-03-04 01:55:00,565 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:00" (1/1) ... [2025-03-04 01:55:00,605 INFO L138 Inliner]: procedures = 30, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 472 [2025-03-04 01:55:00,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:55:00,610 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:55:00,610 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:55:00,610 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:55:00,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:00" (1/1) ... [2025-03-04 01:55:00,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:00" (1/1) ... [2025-03-04 01:55:00,621 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:00" (1/1) ... [2025-03-04 01:55:00,626 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:55:00,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:00" (1/1) ... [2025-03-04 01:55:00,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:00" (1/1) ... [2025-03-04 01:55:00,640 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:00" (1/1) ... [2025-03-04 01:55:00,644 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:00" (1/1) ... [2025-03-04 01:55:00,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:00" (1/1) ... [2025-03-04 01:55:00,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:00" (1/1) ... [2025-03-04 01:55:00,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:55:00,650 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:55:00,650 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:55:00,650 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:55:00,651 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:00" (1/1) ... [2025-03-04 01:55:00,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:55:00,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:55:00,680 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:55:00,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:55:00,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:55:00,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:55:00,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:55:00,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:55:00,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:55:00,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:55:00,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:55:00,699 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:55:00,699 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:55:00,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:55:00,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:55:00,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:55:00,795 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:55:00,796 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:55:01,143 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite90#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite104#1;havoc property_#t~mem97#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem96#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite103#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~short105#1;havoc property_#t~mem108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem109#1;havoc property_#t~short110#1;havoc property_#t~ite123#1;havoc property_#t~mem111#1;havoc property_#t~ite120#1;havoc property_#t~mem119#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite118#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short124#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~short127#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short130#1; [2025-03-04 01:55:01,179 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live. [2025-03-04 01:55:01,179 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:55:01,188 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:55:01,188 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:55:01,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:55:01 BoogieIcfgContainer [2025-03-04 01:55:01,189 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:55:01,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:55:01,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:55:01,197 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:55:01,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:55:00" (1/3) ... [2025-03-04 01:55:01,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc9eb73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:55:01, skipping insertion in model container [2025-03-04 01:55:01,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:00" (2/3) ... [2025-03-04 01:55:01,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fc9eb73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:55:01, skipping insertion in model container [2025-03-04 01:55:01,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:55:01" (3/3) ... [2025-03-04 01:55:01,199 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-75.i [2025-03-04 01:55:01,209 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:55:01,210 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-75.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:55:01,250 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:55:01,261 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;@1288f679, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:55:01,262 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:55:01,265 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:55:01,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:55:01,273 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:55:01,274 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:55:01,274 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:55:01,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:55:01,278 INFO L85 PathProgramCache]: Analyzing trace with hash 308523144, now seen corresponding path program 1 times [2025-03-04 01:55:01,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:55:01,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175861585] [2025-03-04 01:55:01,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:55:01,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:55:01,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:55:01,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:55:01,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:55:01,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:55:01,612 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-04 01:55:01,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:55:01,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175861585] [2025-03-04 01:55:01,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175861585] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:55:01,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072688011] [2025-03-04 01:55:01,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:55:01,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:55:01,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:55:01,617 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:55:01,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:55:01,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:55:01,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:55:01,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:55:01,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:55:01,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:55:01,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:55:01,880 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2025-03-04 01:55:01,880 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:55:01,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072688011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:55:01,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:55:01,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:55:01,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445793550] [2025-03-04 01:55:01,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:55:01,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:55:01,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:55:01,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:55:01,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:55:01,904 INFO L87 Difference]: Start difference. First operand has 96 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:55:01,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:55:01,925 INFO L93 Difference]: Finished difference Result 186 states and 292 transitions. [2025-03-04 01:55:01,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:55:01,926 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2025-03-04 01:55:01,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:55:01,933 INFO L225 Difference]: With dead ends: 186 [2025-03-04 01:55:01,934 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 01:55:01,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:55:01,940 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:55:01,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:55:01,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 01:55:01,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-04 01:55:01,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:55:01,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2025-03-04 01:55:01,971 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 136 [2025-03-04 01:55:01,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:55:01,971 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2025-03-04 01:55:01,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:55:01,971 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2025-03-04 01:55:01,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:55:01,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:55:01,973 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:55:01,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:55:02,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:55:02,174 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:55:02,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:55:02,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1727239871, now seen corresponding path program 1 times [2025-03-04 01:55:02,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:55:02,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393636866] [2025-03-04 01:55:02,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:55:02,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:55:02,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:55:02,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:55:02,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:55:02,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:55:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:55:02,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:55:02,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393636866] [2025-03-04 01:55:02,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393636866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:55:02,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:55:02,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:55:02,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752328346] [2025-03-04 01:55:02,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:55:02,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:55:02,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:55:02,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:55:02,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:55:02,455 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:55:02,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:55:02,491 INFO L93 Difference]: Finished difference Result 185 states and 270 transitions. [2025-03-04 01:55:02,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:55:02,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2025-03-04 01:55:02,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:55:02,493 INFO L225 Difference]: With dead ends: 185 [2025-03-04 01:55:02,493 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 01:55:02,493 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-03-04 01:55:02,494 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:55:02,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:55:02,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 01:55:02,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-03-04 01:55:02,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.355263157894737) internal successors, (103), 76 states have internal predecessors, (103), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:55:02,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2025-03-04 01:55:02,510 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 136 [2025-03-04 01:55:02,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:55:02,511 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2025-03-04 01:55:02,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:55:02,511 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2025-03-04 01:55:02,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:55:02,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:55:02,514 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:55:02,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:55:02,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:55:02,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:55:02,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1086153728, now seen corresponding path program 1 times [2025-03-04 01:55:02,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:55:02,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015544337] [2025-03-04 01:55:02,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:55:02,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:55:02,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:55:02,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:55:02,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:55:02,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:55:02,698 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:55:02,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:55:02,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015544337] [2025-03-04 01:55:02,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015544337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:55:02,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:55:02,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:55:02,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12824607] [2025-03-04 01:55:02,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:55:02,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:55:02,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:55:02,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:55:02,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:55:02,703 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:55:02,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:55:02,741 INFO L93 Difference]: Finished difference Result 189 states and 274 transitions. [2025-03-04 01:55:02,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:55:02,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2025-03-04 01:55:02,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:55:02,743 INFO L225 Difference]: With dead ends: 189 [2025-03-04 01:55:02,743 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 01:55:02,743 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-03-04 01:55:02,744 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:55:02,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 388 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:55:02,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 01:55:02,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-03-04 01:55:02,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 78 states have internal predecessors, (105), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:55:02,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2025-03-04 01:55:02,755 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 136 [2025-03-04 01:55:02,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:55:02,755 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2025-03-04 01:55:02,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:55:02,756 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2025-03-04 01:55:02,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:55:02,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:55:02,759 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:55:02,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:55:02,759 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:55:02,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:55:02,760 INFO L85 PathProgramCache]: Analyzing trace with hash -61459807, now seen corresponding path program 1 times [2025-03-04 01:55:02,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:55:02,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151042003] [2025-03-04 01:55:02,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:55:02,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:55:02,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:55:02,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:55:02,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:55:02,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:55:02,915 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:55:02,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:55:02,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151042003] [2025-03-04 01:55:02,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151042003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:55:02,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:55:02,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:55:02,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247881734] [2025-03-04 01:55:02,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:55:02,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:55:02,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:55:02,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:55:02,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:55:02,919 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:55:02,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:55:02,952 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2025-03-04 01:55:02,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:55:02,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-03-04 01:55:02,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:55:02,954 INFO L225 Difference]: With dead ends: 194 [2025-03-04 01:55:02,954 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 01:55:02,955 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-03-04 01:55:02,956 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:55:02,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 385 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:55:02,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 01:55:02,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-03-04 01:55:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:55:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2025-03-04 01:55:02,963 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 136 [2025-03-04 01:55:02,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:55:02,963 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2025-03-04 01:55:02,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:55:02,964 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2025-03-04 01:55:02,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:55:02,965 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:55:02,965 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:55:02,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:55:02,966 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:55:02,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:55:02,966 INFO L85 PathProgramCache]: Analyzing trace with hash 826043874, now seen corresponding path program 1 times [2025-03-04 01:55:02,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:55:02,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259727542] [2025-03-04 01:55:02,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:55:02,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:55:03,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:55:03,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:55:03,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:55:03,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:55:03,119 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:55:03,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:55:03,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259727542] [2025-03-04 01:55:03,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259727542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:55:03,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:55:03,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:55:03,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789703513] [2025-03-04 01:55:03,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:55:03,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:55:03,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:55:03,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:55:03,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:55:03,121 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:55:03,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:55:03,139 INFO L93 Difference]: Finished difference Result 198 states and 283 transitions. [2025-03-04 01:55:03,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:55:03,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-03-04 01:55:03,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:55:03,141 INFO L225 Difference]: With dead ends: 198 [2025-03-04 01:55:03,141 INFO L226 Difference]: Without dead ends: 102 [2025-03-04 01:55:03,141 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-03-04 01:55:03,141 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:55:03,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 388 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:55:03,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-04 01:55:03,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2025-03-04 01:55:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 82 states have (on average 1.329268292682927) internal successors, (109), 82 states have internal predecessors, (109), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:55:03,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2025-03-04 01:55:03,152 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 136 [2025-03-04 01:55:03,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:55:03,153 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2025-03-04 01:55:03,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:55:03,153 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2025-03-04 01:55:03,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:55:03,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:55:03,156 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:55:03,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:55:03,156 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:55:03,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:55:03,157 INFO L85 PathProgramCache]: Analyzing trace with hash 826967395, now seen corresponding path program 1 times [2025-03-04 01:55:03,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:55:03,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257738344] [2025-03-04 01:55:03,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:55:03,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:55:03,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:55:03,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:55:03,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:55:03,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:55:04,327 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:55:04,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:55:04,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257738344] [2025-03-04 01:55:04,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257738344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:55:04,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:55:04,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:55:04,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604268112] [2025-03-04 01:55:04,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:55:04,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:55:04,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:55:04,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:55:04,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:55:04,330 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:55:04,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:55:04,590 INFO L93 Difference]: Finished difference Result 199 states and 283 transitions. [2025-03-04 01:55:04,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:55:04,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-03-04 01:55:04,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:55:04,591 INFO L225 Difference]: With dead ends: 199 [2025-03-04 01:55:04,592 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 01:55:04,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:55:04,593 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 130 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:55:04,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 347 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:55:04,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 01:55:04,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-04 01:55:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:55:04,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 142 transitions. [2025-03-04 01:55:04,602 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 142 transitions. Word has length 136 [2025-03-04 01:55:04,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:55:04,603 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 142 transitions. [2025-03-04 01:55:04,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:55:04,603 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 142 transitions. [2025-03-04 01:55:04,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 01:55:04,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:55:04,604 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:55:04,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:55:04,604 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:55:04,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:55:04,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1494733343, now seen corresponding path program 1 times [2025-03-04 01:55:04,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:55:04,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077901896] [2025-03-04 01:55:04,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:55:04,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:55:04,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 01:55:04,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 01:55:04,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:55:04,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:55:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:55:09,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:55:09,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077901896] [2025-03-04 01:55:09,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077901896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:55:09,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:55:09,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-04 01:55:09,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449446645] [2025-03-04 01:55:09,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:55:09,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 01:55:09,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:55:09,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 01:55:09,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:55:09,471 INFO L87 Difference]: Start difference. First operand 101 states and 142 transitions. Second operand has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-04 01:55:12,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:55:12,230 INFO L93 Difference]: Finished difference Result 385 states and 539 transitions. [2025-03-04 01:55:12,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 01:55:12,230 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 138 [2025-03-04 01:55:12,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:55:12,232 INFO L225 Difference]: With dead ends: 385 [2025-03-04 01:55:12,232 INFO L226 Difference]: Without dead ends: 287 [2025-03-04 01:55:12,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=208, Invalid=982, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 01:55:12,238 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 425 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 1306 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:55:12,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 980 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1306 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 01:55:12,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-03-04 01:55:12,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 179. [2025-03-04 01:55:12,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 141 states have (on average 1.297872340425532) internal successors, (183), 141 states have internal predecessors, (183), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:55:12,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 251 transitions. [2025-03-04 01:55:12,262 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 251 transitions. Word has length 138 [2025-03-04 01:55:12,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:55:12,263 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 251 transitions. [2025-03-04 01:55:12,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.2941176470588234) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-04 01:55:12,263 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 251 transitions. [2025-03-04 01:55:12,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 01:55:12,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:55:12,265 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:55:12,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:55:12,265 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:55:12,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:55:12,266 INFO L85 PathProgramCache]: Analyzing trace with hash 762177664, now seen corresponding path program 1 times [2025-03-04 01:55:12,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:55:12,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202579739] [2025-03-04 01:55:12,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:55:12,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:55:12,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 01:55:12,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 01:55:12,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:55:12,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:55:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:55:12,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:55:12,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202579739] [2025-03-04 01:55:12,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202579739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:55:12,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:55:12,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:55:12,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013816686] [2025-03-04 01:55:12,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:55:12,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:55:12,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:55:12,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:55:12,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:55:12,943 INFO L87 Difference]: Start difference. First operand 179 states and 251 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:55:13,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:55:13,433 INFO L93 Difference]: Finished difference Result 320 states and 450 transitions. [2025-03-04 01:55:13,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:55:13,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2025-03-04 01:55:13,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:55:13,435 INFO L225 Difference]: With dead ends: 320 [2025-03-04 01:55:13,435 INFO L226 Difference]: Without dead ends: 222 [2025-03-04 01:55:13,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:55:13,436 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 142 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:55:13,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 407 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:55:13,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-04 01:55:13,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 190. [2025-03-04 01:55:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 152 states have (on average 1.3092105263157894) internal successors, (199), 152 states have internal predecessors, (199), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:55:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 267 transitions. [2025-03-04 01:55:13,454 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 267 transitions. Word has length 138 [2025-03-04 01:55:13,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:55:13,455 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 267 transitions. [2025-03-04 01:55:13,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:55:13,455 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 267 transitions. [2025-03-04 01:55:13,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-04 01:55:13,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:55:13,457 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:55:13,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:55:13,457 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:55:13,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:55:13,458 INFO L85 PathProgramCache]: Analyzing trace with hash 251643487, now seen corresponding path program 1 times [2025-03-04 01:55:13,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:55:13,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847111988] [2025-03-04 01:55:13,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:55:13,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:55:13,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 01:55:13,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 01:55:13,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:55:13,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:55:14,566 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:55:14,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:55:14,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847111988] [2025-03-04 01:55:14,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847111988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:55:14,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:55:14,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:55:14,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611246206] [2025-03-04 01:55:14,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:55:14,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:55:14,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:55:14,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:55:14,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:55:14,569 INFO L87 Difference]: Start difference. First operand 190 states and 267 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:55:15,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:55:15,529 INFO L93 Difference]: Finished difference Result 400 states and 561 transitions. [2025-03-04 01:55:15,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:55:15,531 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 138 [2025-03-04 01:55:15,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:55:15,532 INFO L225 Difference]: With dead ends: 400 [2025-03-04 01:55:15,532 INFO L226 Difference]: Without dead ends: 291 [2025-03-04 01:55:15,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:55:15,533 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 211 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:55:15,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 769 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:55:15,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-03-04 01:55:15,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 196. [2025-03-04 01:55:15,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 158 states have (on average 1.3227848101265822) internal successors, (209), 159 states have internal predecessors, (209), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:55:15,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 277 transitions. [2025-03-04 01:55:15,555 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 277 transitions. Word has length 138 [2025-03-04 01:55:15,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:55:15,555 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 277 transitions. [2025-03-04 01:55:15,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:55:15,556 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 277 transitions. [2025-03-04 01:55:15,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 01:55:15,564 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:55:15,565 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:55:15,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:55:15,565 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:55:15,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:55:15,566 INFO L85 PathProgramCache]: Analyzing trace with hash -533420340, now seen corresponding path program 1 times [2025-03-04 01:55:15,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:55:15,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987574542] [2025-03-04 01:55:15,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:55:15,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:55:15,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:55:15,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:55:15,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:55:15,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:55:15,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [944136057] [2025-03-04 01:55:15,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:55:15,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:55:15,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:55:15,663 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:55:15,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:55:15,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:55:17,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:55:17,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:55:17,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:55:17,103 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:55:17,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:55:17,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:55:17,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:55:17,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:55:17,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:55:17,958 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:55:17,959 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:55:17,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 01:55:18,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 01:55:18,163 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:55:18,269 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:55:18,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:55:18 BoogieIcfgContainer [2025-03-04 01:55:18,272 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:55:18,272 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:55:18,272 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:55:18,273 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:55:18,273 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:55:01" (3/4) ... [2025-03-04 01:55:18,274 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:55:18,275 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:55:18,276 INFO L158 Benchmark]: Toolchain (without parser) took 17949.43ms. Allocated memory was 167.8MB in the beginning and 604.0MB in the end (delta: 436.2MB). Free memory was 133.4MB in the beginning and 425.8MB in the end (delta: -292.4MB). Peak memory consumption was 147.5MB. Max. memory is 16.1GB. [2025-03-04 01:55:18,277 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:55:18,277 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.10ms. Allocated memory is still 167.8MB. Free memory was 133.0MB in the beginning and 117.4MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:55:18,278 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.82ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 114.0MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:55:18,278 INFO L158 Benchmark]: Boogie Preprocessor took 39.46ms. Allocated memory is still 167.8MB. Free memory was 114.0MB in the beginning and 111.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:55:18,278 INFO L158 Benchmark]: IcfgBuilder took 538.72ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 78.5MB in the end (delta: 33.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 01:55:18,278 INFO L158 Benchmark]: TraceAbstraction took 17078.20ms. Allocated memory was 167.8MB in the beginning and 604.0MB in the end (delta: 436.2MB). Free memory was 77.7MB in the beginning and 426.0MB in the end (delta: -348.3MB). Peak memory consumption was 80.4MB. Max. memory is 16.1GB. [2025-03-04 01:55:18,279 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 604.0MB. Free memory was 426.0MB in the beginning and 425.8MB in the end (delta: 193.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:55:18,280 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.46ms. Allocated memory is still 201.3MB. Free memory is still 126.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 226.10ms. Allocated memory is still 167.8MB. Free memory was 133.0MB in the beginning and 117.4MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.82ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 114.0MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.46ms. Allocated memory is still 167.8MB. Free memory was 114.0MB in the beginning and 111.7MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 538.72ms. Allocated memory is still 167.8MB. Free memory was 111.7MB in the beginning and 78.5MB in the end (delta: 33.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 17078.20ms. Allocated memory was 167.8MB in the beginning and 604.0MB in the end (delta: 436.2MB). Free memory was 77.7MB in the beginning and 426.0MB in the end (delta: -348.3MB). Peak memory consumption was 80.4MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 604.0MB. Free memory was 426.0MB in the beginning and 425.8MB in the end (delta: 193.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryDOUBLEComparisonOperation at line 104, overapproximation of someBinaryDOUBLEComparisonOperation at line 130, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 75, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 78. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 32, -100, 5.95, 128, 200, 8, 0, 128, 1, 2.25, 16.875, -4, 10 }; [L55] unsigned char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L57] signed long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L58] double* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L59] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L60] unsigned char* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L61] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L62] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L63] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L64] unsigned char* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L65] float* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L66] float* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); [L67] signed char* WrapperStruct00_var_1_20_Pointer = &(WrapperStruct00.var_1_20); [L68] signed char* WrapperStruct00_var_1_21_Pointer = &(WrapperStruct00.var_1_21); [L69] signed long int last_1_WrapperStruct00_var_1_8 = -100; VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=0, last_1_WrapperStruct00_var_1_8=-100] [L134] isInitial = 1 [L135] FCALL initially() [L136] COND TRUE 1 [L137] CALL updateLastVariables() [L127] EXPR WrapperStruct00.var_1_8 [L127] last_1_WrapperStruct00_var_1_8 = WrapperStruct00.var_1_8 [L137] RET updateLastVariables() [L138] CALL updateVariables() [L99] WrapperStruct00.var_1_7 = __VERIFIER_nondet_uchar() [L100] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L101] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L102] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L103] EXPR WrapperStruct00.var_1_10 [L103] EXPR WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_10 [L103] EXPR WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L103] EXPR (WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L104] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_10 != 0.0F) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_10 != 0.0F) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L105] WrapperStruct00.var_1_13 = __VERIFIER_nondet_uchar() [L106] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L107] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 255) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L108] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L109] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L110] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L111] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L112] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L113] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L114] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L115] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L115] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L115] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L117] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L118] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L118] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L118] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L119] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L120] WrapperStruct00.var_1_19 = __VERIFIER_nondet_float() [L121] EXPR WrapperStruct00.var_1_19 [L121] EXPR WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F [L121] EXPR WrapperStruct00.var_1_19 [L121] EXPR WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L121] EXPR (WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L121] CALL assume_abort_if_not((WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L121] RET assume_abort_if_not((WrapperStruct00.var_1_19 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_19 <= -1.0e-20F) || (WrapperStruct00.var_1_19 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_19 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L122] WrapperStruct00.var_1_21 = __VERIFIER_nondet_char() [L123] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_21 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_21 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L124] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L124] CALL assume_abort_if_not(WrapperStruct00.var_1_21 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L124] RET assume_abort_if_not(WrapperStruct00.var_1_21 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L138] RET updateVariables() [L139] CALL step() [L73] EXPR \read(*WrapperStruct00_var_1_19_Pointer) [L73] (*(WrapperStruct00_var_1_18_Pointer)) = (*(WrapperStruct00_var_1_19_Pointer)) [L74] EXPR \read(*WrapperStruct00_var_1_21_Pointer) [L74] (*(WrapperStruct00_var_1_20_Pointer)) = (*(WrapperStruct00_var_1_21_Pointer)) [L75] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L75] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L75] EXPR \read(*WrapperStruct00_var_1_18_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L75] COND FALSE !(((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) [L78] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L78] EXPR \read(*WrapperStruct00_var_1_10_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L78] COND FALSE !((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) [L81] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L81] (*(WrapperStruct00_var_1_8_Pointer)) = (*(WrapperStruct00_var_1_20_Pointer)) [L84] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L84] signed long int stepLocal_0 = ((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer)); [L85] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L85] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100, stepLocal_0=-27] [L85] EXPR (((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))) [L85] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L85] EXPR (((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100, stepLocal_0=-27] [L85] COND TRUE stepLocal_0 < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))))) [L86] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L86] (*(WrapperStruct00_var_1_1_Pointer)) = (*(WrapperStruct00_var_1_7_Pointer)) [L90] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L90] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L90] ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) && (*(WrapperStruct00_var_1_15_Pointer)) [L90] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L90] ((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) && (*(WrapperStruct00_var_1_15_Pointer)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L90] COND FALSE !(((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) && (*(WrapperStruct00_var_1_15_Pointer))) [L95] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L95] (*(WrapperStruct00_var_1_12_Pointer)) = (*(WrapperStruct00_var_1_17_Pointer)) [L139] RET step() [L140] CALL, EXPR property() [L130] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR (((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))) [L130] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L130] EXPR (((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) [L130] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L130] EXPR ((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR (((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer)))))) [L130] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_18_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR (((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer))))) [L130] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_7_Pointer) [L130] EXPR \read(*WrapperStruct00_var_1_20_Pointer) [L130] EXPR (((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR (((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR ((((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer))))))) && ((((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_15_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR (((((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer))))))) && ((((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_15_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer)))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((float) (*(WrapperStruct00_var_1_19_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130] EXPR ((((((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer))))))) && ((((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_15_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer)))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((float) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_21_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L130-L131] return ((((((((*(WrapperStruct00_var_1_8_Pointer)) * (*(WrapperStruct00_var_1_20_Pointer))) * (*(WrapperStruct00_var_1_8_Pointer))) < (((((*(WrapperStruct00_var_1_20_Pointer))) > ((*(WrapperStruct00_var_1_8_Pointer)))) ? ((*(WrapperStruct00_var_1_20_Pointer))) : ((*(WrapperStruct00_var_1_8_Pointer)))))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer)))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((((*(WrapperStruct00_var_1_18_Pointer)) / (*(WrapperStruct00_var_1_10_Pointer))) >= ((*(WrapperStruct00_var_1_18_Pointer)) / 128.6)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (((*(WrapperStruct00_var_1_20_Pointer)) + ((*(WrapperStruct00_var_1_7_Pointer)) + last_1_WrapperStruct00_var_1_8)) - (*(WrapperStruct00_var_1_20_Pointer))))) : (((*(WrapperStruct00_var_1_18_Pointer)) <= (*(WrapperStruct00_var_1_10_Pointer))) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) 256)) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((signed long int) (*(WrapperStruct00_var_1_20_Pointer))))))) && ((((*(WrapperStruct00_var_1_1_Pointer)) == ((*(WrapperStruct00_var_1_13_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) && (*(WrapperStruct00_var_1_15_Pointer))) ? ((*(WrapperStruct00_var_1_15_Pointer)) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((((((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_7_Pointer)))) ? (((*(WrapperStruct00_var_1_16_Pointer)) - (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_7_Pointer))))))) : 1) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_17_Pointer)))))) && ((*(WrapperStruct00_var_1_18_Pointer)) == ((float) (*(WrapperStruct00_var_1_19_Pointer))))) && ((*(WrapperStruct00_var_1_20_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_21_Pointer)))) ; [L140] RET, EXPR property() [L140] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:6}, WrapperStruct00_var_1_12_Pointer={4:14}, WrapperStruct00_var_1_13_Pointer={4:15}, WrapperStruct00_var_1_14_Pointer={4:16}, WrapperStruct00_var_1_15_Pointer={4:17}, WrapperStruct00_var_1_16_Pointer={4:18}, WrapperStruct00_var_1_17_Pointer={4:19}, WrapperStruct00_var_1_18_Pointer={4:20}, WrapperStruct00_var_1_19_Pointer={4:24}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_20_Pointer={4:28}, WrapperStruct00_var_1_21_Pointer={4:29}, WrapperStruct00_var_1_7_Pointer={4:1}, WrapperStruct00_var_1_8_Pointer={4:2}, isInitial=1, last_1_WrapperStruct00_var_1_8=-100] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.9s, OverallIterations: 10, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 910 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 910 mSDsluCounter, 4187 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3064 mSDsCounter, 185 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2639 IncrementalHoareTripleChecker+Invalid, 2824 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 185 mSolverCounterUnsat, 1123 mSDtfsCounter, 2639 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 169 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=9, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 237 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 1644 NumberOfCodeBlocks, 1644 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1356 ConstructedInterpolants, 0 QuantifiedInterpolants, 10291 SizeOfPredicates, 0 NumberOfNonLiveVariables, 570 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 5408/5440 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-03-04 01:55:18,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-75.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 3ea1453e8ddb919b166a2b196c485b49328495abf45a9dcbd47a0aceac1e3901 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:55:20,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:55:20,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:55:20,251 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:55:20,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:55:20,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:55:20,271 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:55:20,271 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:55:20,271 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:55:20,272 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:55:20,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:55:20,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:55:20,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:55:20,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:55:20,273 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:55:20,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:55:20,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:55:20,274 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:55:20,274 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:55:20,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:55:20,274 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:55:20,274 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:55:20,274 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:55:20,274 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:55:20,274 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:55:20,274 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:55:20,274 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:55:20,274 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:55:20,275 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:55:20,275 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:55:20,275 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:55:20,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:55:20,275 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:55:20,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:55:20,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:55:20,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:55:20,275 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:55:20,275 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:55:20,275 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:55:20,276 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:55:20,276 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:55:20,276 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:55:20,276 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:55:20,276 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:55:20,276 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:55:20,276 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/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 -> 3ea1453e8ddb919b166a2b196c485b49328495abf45a9dcbd47a0aceac1e3901 [2025-03-04 01:55:20,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:55:20,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:55:20,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:55:20,592 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:55:20,593 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:55:20,594 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-75.i [2025-03-04 01:55:21,739 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ae872c69/5448118e00fc4619a57567f06fca6487/FLAG01cdb0525 [2025-03-04 01:55:21,953 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:55:21,954 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-75.i [2025-03-04 01:55:21,962 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ae872c69/5448118e00fc4619a57567f06fca6487/FLAG01cdb0525 [2025-03-04 01:55:21,978 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ae872c69/5448118e00fc4619a57567f06fca6487 [2025-03-04 01:55:21,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:55:21,983 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:55:21,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:55:21,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:55:21,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:55:21,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:55:21" (1/1) ... [2025-03-04 01:55:21,990 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d5bf132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:21, skipping insertion in model container [2025-03-04 01:55:21,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:55:21" (1/1) ... [2025-03-04 01:55:22,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:55:22,117 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-75.i[917,930] [2025-03-04 01:55:22,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:55:22,200 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:55:22,208 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-75.i[917,930] [2025-03-04 01:55:22,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:55:22,251 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:55:22,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:22 WrapperNode [2025-03-04 01:55:22,252 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:55:22,253 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:55:22,253 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:55:22,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:55:22,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:22" (1/1) ... [2025-03-04 01:55:22,266 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:22" (1/1) ... [2025-03-04 01:55:22,297 INFO L138 Inliner]: procedures = 37, calls = 160, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 470 [2025-03-04 01:55:22,297 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:55:22,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:55:22,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:55:22,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:55:22,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:22" (1/1) ... [2025-03-04 01:55:22,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:22" (1/1) ... [2025-03-04 01:55:22,313 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:22" (1/1) ... [2025-03-04 01:55:22,345 INFO L175 MemorySlicer]: Split 132 memory accesses to 2 slices as follows [2, 130]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2025-03-04 01:55:22,348 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:22" (1/1) ... [2025-03-04 01:55:22,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:22" (1/1) ... [2025-03-04 01:55:22,375 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:22" (1/1) ... [2025-03-04 01:55:22,376 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:22" (1/1) ... [2025-03-04 01:55:22,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:22" (1/1) ... [2025-03-04 01:55:22,384 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:22" (1/1) ... [2025-03-04 01:55:22,392 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:55:22,393 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:55:22,393 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:55:22,393 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:55:22,394 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:22" (1/1) ... [2025-03-04 01:55:22,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:55:22,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:55:22,421 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:55:22,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:55:22,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:55:22,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:55:22,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:55:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-04 01:55:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-04 01:55:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:55:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:55:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:55:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:55:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:55:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:55:22,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:55:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:55:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:55:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:55:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-04 01:55:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-04 01:55:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:55:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:55:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-04 01:55:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-04 01:55:22,447 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:55:22,448 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:55:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-04 01:55:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-04 01:55:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:55:22,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:55:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:55:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:55:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:55:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:55:22,594 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:55:22,596 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:55:42,883 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L130: havoc property_#t~mem78#1;havoc property_#t~mem79#1;havoc property_#t~mem80#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite85#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite90#1;havoc property_#t~mem87#1;havoc property_#t~mem86#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite104#1;havoc property_#t~mem97#1;havoc property_#t~mem95#1;havoc property_#t~mem94#1;havoc property_#t~mem96#1;havoc property_#t~mem98#1;havoc property_#t~mem99#1;havoc property_#t~ite103#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~short105#1;havoc property_#t~mem108#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~mem109#1;havoc property_#t~short110#1;havoc property_#t~ite123#1;havoc property_#t~mem111#1;havoc property_#t~ite120#1;havoc property_#t~mem119#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite118#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~mem122#1;havoc property_#t~mem121#1;havoc property_#t~short124#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~short127#1;havoc property_#t~mem129#1;havoc property_#t~mem128#1;havoc property_#t~short130#1; [2025-03-04 01:55:42,914 INFO L? ?]: Removed 113 outVars from TransFormulas that were not future-live. [2025-03-04 01:55:42,914 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:55:42,926 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:55:42,927 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:55:42,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:55:42 BoogieIcfgContainer [2025-03-04 01:55:42,927 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:55:42,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:55:42,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:55:42,932 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:55:42,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:55:21" (1/3) ... [2025-03-04 01:55:42,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31bf3d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:55:42, skipping insertion in model container [2025-03-04 01:55:42,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:55:22" (2/3) ... [2025-03-04 01:55:42,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31bf3d92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:55:42, skipping insertion in model container [2025-03-04 01:55:42,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:55:42" (3/3) ... [2025-03-04 01:55:42,934 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-75.i [2025-03-04 01:55:42,944 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:55:42,945 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-75.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:55:42,978 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:55:42,986 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;@53ff66e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:55:42,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:55:42,994 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:55:43,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:55:43,004 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:55:43,004 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:55:43,005 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:55:43,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:55:43,008 INFO L85 PathProgramCache]: Analyzing trace with hash 507046982, now seen corresponding path program 1 times [2025-03-04 01:55:43,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:55:43,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967401116] [2025-03-04 01:55:43,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:55:43,017 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-03-04 01:55:43,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:55:43,020 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-03-04 01:55:43,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:55:43,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:55:44,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:55:44,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:55:44,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:55:44,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:55:44,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:55:44,548 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 272 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-04 01:55:44,548 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:55:44,548 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:55:44,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967401116] [2025-03-04 01:55:44,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967401116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:55:44,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:55:44,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:55:44,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383714743] [2025-03-04 01:55:44,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:55:44,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:55:44,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:55:44,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:55:44,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:55:44,571 INFO L87 Difference]: Start difference. First operand has 96 states, 76 states have (on average 1.394736842105263) internal successors, (106), 77 states have internal predecessors, (106), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:55:44,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:55:44,596 INFO L93 Difference]: Finished difference Result 186 states and 292 transitions. [2025-03-04 01:55:44,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:55:44,597 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 136 [2025-03-04 01:55:44,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:55:44,602 INFO L225 Difference]: With dead ends: 186 [2025-03-04 01:55:44,602 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 01:55:44,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:55:44,606 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:55:44,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:55:44,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 01:55:44,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-03-04 01:55:44,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:55:44,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2025-03-04 01:55:44,631 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 136 [2025-03-04 01:55:44,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:55:44,632 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2025-03-04 01:55:44,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-04 01:55:44,632 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2025-03-04 01:55:44,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:55:44,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:55:44,634 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:55:44,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:55:44,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-03-04 01:55:44,835 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:55:44,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:55:44,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1528716033, now seen corresponding path program 1 times [2025-03-04 01:55:44,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:55:44,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274106826] [2025-03-04 01:55:44,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:55:44,836 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-03-04 01:55:44,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:55:44,838 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-03-04 01:55:44,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:55:44,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:55:46,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:55:46,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:55:46,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:55:46,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:55:46,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:55:47,031 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:55:47,031 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:55:47,031 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:55:47,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274106826] [2025-03-04 01:55:47,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274106826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:55:47,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:55:47,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:55:47,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143018511] [2025-03-04 01:55:47,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:55:47,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:55:47,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:55:47,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:55:47,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:55:47,034 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:55:47,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:55:47,978 INFO L93 Difference]: Finished difference Result 188 states and 274 transitions. [2025-03-04 01:55:47,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:55:47,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-03-04 01:55:47,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:55:47,982 INFO L225 Difference]: With dead ends: 188 [2025-03-04 01:55:47,982 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 01:55:47,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:55:47,983 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 01:55:47,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 504 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 01:55:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 01:55:47,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-03-04 01:55:47,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 78 states have (on average 1.3461538461538463) internal successors, (105), 78 states have internal predecessors, (105), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:55:47,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2025-03-04 01:55:47,991 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 136 [2025-03-04 01:55:47,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:55:47,993 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2025-03-04 01:55:47,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:55:47,993 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2025-03-04 01:55:47,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:55:47,994 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:55:47,994 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:55:48,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:55:48,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-03-04 01:55:48,195 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:55:48,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:55:48,196 INFO L85 PathProgramCache]: Analyzing trace with hash -641212352, now seen corresponding path program 1 times [2025-03-04 01:55:48,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:55:48,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865967368] [2025-03-04 01:55:48,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:55:48,197 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-03-04 01:55:48,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:55:48,199 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-03-04 01:55:48,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:55:48,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:55:49,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:55:49,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:55:49,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:55:49,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:55:49,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:55:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-03-04 01:55:50,738 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:55:50,738 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:55:50,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [865967368] [2025-03-04 01:55:50,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [865967368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:55:50,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:55:50,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:55:50,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605533386] [2025-03-04 01:55:50,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:55:50,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:55:50,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:55:50,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:55:50,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:55:50,740 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:55:51,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:55:51,976 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2025-03-04 01:55:51,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:55:51,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 136 [2025-03-04 01:55:51,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:55:51,977 INFO L225 Difference]: With dead ends: 194 [2025-03-04 01:55:51,977 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 01:55:51,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:55:51,979 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 1 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:55:51,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 624 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 01:55:51,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 01:55:51,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2025-03-04 01:55:51,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 01:55:51,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2025-03-04 01:55:51,984 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 136 [2025-03-04 01:55:51,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:55:51,985 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2025-03-04 01:55:51,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2025-03-04 01:55:51,985 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2025-03-04 01:55:51,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-04 01:55:51,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:55:51,986 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:55:52,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:55:52,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-03-04 01:55:52,188 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:55:52,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:55:52,188 INFO L85 PathProgramCache]: Analyzing trace with hash -640288831, now seen corresponding path program 1 times [2025-03-04 01:55:52,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:55:52,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1048122739] [2025-03-04 01:55:52,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:55:52,189 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-03-04 01:55:52,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:55:52,211 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-03-04 01:55:52,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-03-04 01:55:52,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-04 01:56:00,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-04 01:56:00,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:56:00,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:56:00,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-03-04 01:56:00,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:56:04,317 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-03-04 01:56:12,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2025-03-04 01:56:29,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12