./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eec8f8284372b98229413b7ee99f903f6568b9039ed1b67a16348dd2452d2dbd --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 18:20:00,378 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 18:20:00,436 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-23 18:20:00,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 18:20:00,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 18:20:00,467 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 18:20:00,467 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 18:20:00,468 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 18:20:00,468 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 18:20:00,468 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 18:20:00,468 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 18:20:00,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 18:20:00,469 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 18:20:00,469 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 18:20:00,469 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 18:20:00,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 18:20:00,470 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 18:20:00,470 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 18:20:00,470 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 18:20:00,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 18:20:00,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 18:20:00,470 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 18:20:00,470 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 18:20:00,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 18:20:00,471 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 18:20:00,474 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 18:20:00,475 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 18:20:00,475 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 18:20:00,475 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 18:20:00,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 18:20:00,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 18:20:00,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 18:20:00,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 18:20:00,475 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 18:20:00,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 18:20:00,476 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 18:20:00,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 18:20:00,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 18:20:00,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 18:20:00,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 18:20:00,476 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-23 18:20:00,476 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 18:20:00,476 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 18:20:00,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 18:20:00,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 18:20:00,476 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 18:20:00,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 18:20:00,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 18:20:00,477 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eec8f8284372b98229413b7ee99f903f6568b9039ed1b67a16348dd2452d2dbd [2024-11-23 18:20:00,815 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 18:20:00,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 18:20:00,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 18:20:00,834 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 18:20:00,834 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 18:20:00,836 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i [2024-11-23 18:20:03,881 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/data/f2b70c515/5cf9f34878a54bdab6cd76a1572b0923/FLAG093376f59 [2024-11-23 18:20:04,180 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 18:20:04,181 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i [2024-11-23 18:20:04,190 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/data/f2b70c515/5cf9f34878a54bdab6cd76a1572b0923/FLAG093376f59 [2024-11-23 18:20:04,206 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/data/f2b70c515/5cf9f34878a54bdab6cd76a1572b0923 [2024-11-23 18:20:04,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 18:20:04,210 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 18:20:04,212 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 18:20:04,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 18:20:04,217 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 18:20:04,218 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:20:04" (1/1) ... [2024-11-23 18:20:04,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60fab97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:04, skipping insertion in model container [2024-11-23 18:20:04,220 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:20:04" (1/1) ... [2024-11-23 18:20:04,247 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 18:20:04,438 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i[917,930] [2024-11-23 18:20:04,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 18:20:04,570 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 18:20:04,585 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i[917,930] [2024-11-23 18:20:04,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 18:20:04,681 INFO L204 MainTranslator]: Completed translation [2024-11-23 18:20:04,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:04 WrapperNode [2024-11-23 18:20:04,682 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 18:20:04,683 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 18:20:04,684 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 18:20:04,684 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 18:20:04,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:04" (1/1) ... [2024-11-23 18:20:04,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:04" (1/1) ... [2024-11-23 18:20:04,772 INFO L138 Inliner]: procedures = 30, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 470 [2024-11-23 18:20:04,772 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 18:20:04,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 18:20:04,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 18:20:04,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 18:20:04,784 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:04" (1/1) ... [2024-11-23 18:20:04,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:04" (1/1) ... [2024-11-23 18:20:04,791 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:04" (1/1) ... [2024-11-23 18:20:04,804 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-23 18:20:04,808 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:04" (1/1) ... [2024-11-23 18:20:04,809 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:04" (1/1) ... [2024-11-23 18:20:04,831 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:04" (1/1) ... [2024-11-23 18:20:04,833 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:04" (1/1) ... [2024-11-23 18:20:04,838 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:04" (1/1) ... [2024-11-23 18:20:04,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:04" (1/1) ... [2024-11-23 18:20:04,843 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:04" (1/1) ... [2024-11-23 18:20:04,850 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 18:20:04,854 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 18:20:04,855 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 18:20:04,856 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 18:20:04,857 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:04" (1/1) ... [2024-11-23 18:20:04,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 18:20:04,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:20:04,899 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 18:20:04,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 18:20:04,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 18:20:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-23 18:20:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-23 18:20:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-23 18:20:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-23 18:20:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-23 18:20:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-23 18:20:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-23 18:20:04,939 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-23 18:20:04,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-23 18:20:04,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 18:20:04,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 18:20:05,103 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 18:20:05,106 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 18:20:05,847 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-11-23 18:20:05,849 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 18:20:05,870 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 18:20:05,872 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-23 18:20:05,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:20:05 BoogieIcfgContainer [2024-11-23 18:20:05,873 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 18:20:05,902 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 18:20:05,902 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 18:20:05,908 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 18:20:05,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:20:04" (1/3) ... [2024-11-23 18:20:05,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d12de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:20:05, skipping insertion in model container [2024-11-23 18:20:05,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:04" (2/3) ... [2024-11-23 18:20:05,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d12de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:20:05, skipping insertion in model container [2024-11-23 18:20:05,912 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:20:05" (3/3) ... [2024-11-23 18:20:05,913 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-24.i [2024-11-23 18:20:05,937 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 18:20:05,939 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-24.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-23 18:20:06,015 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 18:20:06,030 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;@7ad9e396, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 18:20:06,030 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-23 18:20:06,037 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:20:06,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-23 18:20:06,052 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:20:06,052 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:20:06,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:20:06,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:20:06,061 INFO L85 PathProgramCache]: Analyzing trace with hash 341014851, now seen corresponding path program 1 times [2024-11-23 18:20:06,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:20:06,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051575942] [2024-11-23 18:20:06,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:20:06,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:20:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:20:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-23 18:20:06,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:20:06,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051575942] [2024-11-23 18:20:06,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051575942] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:20:06,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984419951] [2024-11-23 18:20:06,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:20:06,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:20:06,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:20:06,606 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:20:06,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 18:20:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:20:07,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-23 18:20:07,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:20:07,061 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-23 18:20:07,061 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 18:20:07,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984419951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:20:07,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 18:20:07,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-23 18:20:07,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242919329] [2024-11-23 18:20:07,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:20:07,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-23 18:20:07,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:20:07,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-23 18:20:07,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 18:20:07,100 INFO L87 Difference]: Start difference. First operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-23 18:20:07,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:20:07,141 INFO L93 Difference]: Finished difference Result 195 states and 301 transitions. [2024-11-23 18:20:07,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-23 18:20:07,143 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-11-23 18:20:07,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:20:07,153 INFO L225 Difference]: With dead ends: 195 [2024-11-23 18:20:07,154 INFO L226 Difference]: Without dead ends: 97 [2024-11-23 18:20:07,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 18:20:07,162 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 18:20:07,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 18:20:07,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-23 18:20:07,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-23 18:20:07,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:20:07,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-23 18:20:07,207 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 124 [2024-11-23 18:20:07,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:20:07,208 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-23 18:20:07,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-23 18:20:07,208 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-23 18:20:07,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-23 18:20:07,218 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:20:07,218 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:20:07,230 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-23 18:20:07,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:20:07,419 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:20:07,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:20:07,419 INFO L85 PathProgramCache]: Analyzing trace with hash -984360163, now seen corresponding path program 1 times [2024-11-23 18:20:07,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:20:07,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213478982] [2024-11-23 18:20:07,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:20:07,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:20:07,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:20:07,902 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-23 18:20:07,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:20:07,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213478982] [2024-11-23 18:20:07,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213478982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:20:07,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:20:07,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 18:20:07,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364824594] [2024-11-23 18:20:07,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:20:07,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 18:20:07,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:20:07,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 18:20:07,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 18:20:07,907 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-23 18:20:07,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:20:07,970 INFO L93 Difference]: Finished difference Result 193 states and 278 transitions. [2024-11-23 18:20:07,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 18:20:07,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-11-23 18:20:07,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:20:07,977 INFO L225 Difference]: With dead ends: 193 [2024-11-23 18:20:07,977 INFO L226 Difference]: Without dead ends: 99 [2024-11-23 18:20:07,978 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 [2024-11-23 18:20:07,978 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 400 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 [2024-11-23 18:20:07,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 400 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 18:20:07,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-23 18:20:07,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-23 18:20:07,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:20:08,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-23 18:20:08,003 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 124 [2024-11-23 18:20:08,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:20:08,004 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-23 18:20:08,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-23 18:20:08,009 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-23 18:20:08,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-23 18:20:08,010 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:20:08,011 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:20:08,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-23 18:20:08,011 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:20:08,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:20:08,012 INFO L85 PathProgramCache]: Analyzing trace with hash -140354661, now seen corresponding path program 1 times [2024-11-23 18:20:08,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:20:08,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047305600] [2024-11-23 18:20:08,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:20:08,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:20:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:20:08,351 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-23 18:20:08,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:20:08,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047305600] [2024-11-23 18:20:08,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047305600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:20:08,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:20:08,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 18:20:08,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525636669] [2024-11-23 18:20:08,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:20:08,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 18:20:08,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:20:08,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 18:20:08,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 18:20:08,355 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:08,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:20:08,405 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2024-11-23 18:20:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 18:20:08,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-23 18:20:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:20:08,408 INFO L225 Difference]: With dead ends: 196 [2024-11-23 18:20:08,408 INFO L226 Difference]: Without dead ends: 100 [2024-11-23 18:20:08,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 18:20:08,412 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 18:20:08,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 18:20:08,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-23 18:20:08,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-23 18:20:08,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 83 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:20:08,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2024-11-23 18:20:08,434 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 124 [2024-11-23 18:20:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:20:08,435 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2024-11-23 18:20:08,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:08,436 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2024-11-23 18:20:08,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-23 18:20:08,440 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:20:08,441 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:20:08,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-23 18:20:08,441 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:20:08,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:20:08,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1945792995, now seen corresponding path program 1 times [2024-11-23 18:20:08,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:20:08,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001150368] [2024-11-23 18:20:08,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:20:08,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:20:08,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:20:08,690 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-23 18:20:08,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:20:08,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001150368] [2024-11-23 18:20:08,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001150368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:20:08,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:20:08,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 18:20:08,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864098142] [2024-11-23 18:20:08,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:20:08,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 18:20:08,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:20:08,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 18:20:08,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 18:20:08,696 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:08,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:20:08,730 INFO L93 Difference]: Finished difference Result 198 states and 283 transitions. [2024-11-23 18:20:08,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 18:20:08,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-23 18:20:08,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:20:08,733 INFO L225 Difference]: With dead ends: 198 [2024-11-23 18:20:08,733 INFO L226 Difference]: Without dead ends: 101 [2024-11-23 18:20:08,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 18:20:08,738 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 18:20:08,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 18:20:08,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-23 18:20:08,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-23 18:20:08,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 84 states have internal predecessors, (113), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:20:08,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-11-23 18:20:08,756 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 124 [2024-11-23 18:20:08,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:20:08,757 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-11-23 18:20:08,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:08,757 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-11-23 18:20:08,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-23 18:20:08,764 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:20:08,764 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:20:08,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-23 18:20:08,764 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:20:08,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:20:08,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1328105947, now seen corresponding path program 1 times [2024-11-23 18:20:08,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:20:08,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085349407] [2024-11-23 18:20:08,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:20:08,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:20:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:20:09,088 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-23 18:20:09,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:20:09,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085349407] [2024-11-23 18:20:09,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085349407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:20:09,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:20:09,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 18:20:09,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208664920] [2024-11-23 18:20:09,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:20:09,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 18:20:09,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:20:09,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 18:20:09,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 18:20:09,091 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:09,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:20:09,130 INFO L93 Difference]: Finished difference Result 202 states and 287 transitions. [2024-11-23 18:20:09,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 18:20:09,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-23 18:20:09,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:20:09,132 INFO L225 Difference]: With dead ends: 202 [2024-11-23 18:20:09,132 INFO L226 Difference]: Without dead ends: 104 [2024-11-23 18:20:09,133 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 [2024-11-23 18:20:09,134 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 18:20:09,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 397 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 18:20:09,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-23 18:20:09,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-23 18:20:09,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:20:09,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2024-11-23 18:20:09,148 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 124 [2024-11-23 18:20:09,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:20:09,148 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2024-11-23 18:20:09,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:09,151 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2024-11-23 18:20:09,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-23 18:20:09,153 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:20:09,154 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:20:09,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-23 18:20:09,155 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:20:09,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:20:09,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2008164317, now seen corresponding path program 1 times [2024-11-23 18:20:09,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:20:09,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511441063] [2024-11-23 18:20:09,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:20:09,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:20:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:20:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-23 18:20:09,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:20:09,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511441063] [2024-11-23 18:20:09,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511441063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:20:09,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:20:09,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 18:20:09,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974855270] [2024-11-23 18:20:09,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:20:09,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 18:20:09,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:20:09,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 18:20:09,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 18:20:09,406 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:09,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:20:09,444 INFO L93 Difference]: Finished difference Result 206 states and 291 transitions. [2024-11-23 18:20:09,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 18:20:09,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-23 18:20:09,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:20:09,447 INFO L225 Difference]: With dead ends: 206 [2024-11-23 18:20:09,447 INFO L226 Difference]: Without dead ends: 106 [2024-11-23 18:20:09,448 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 [2024-11-23 18:20:09,448 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 18:20:09,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 398 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 18:20:09,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-23 18:20:09,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-23 18:20:09,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:20:09,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2024-11-23 18:20:09,463 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 124 [2024-11-23 18:20:09,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:20:09,467 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2024-11-23 18:20:09,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:09,467 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2024-11-23 18:20:09,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-23 18:20:09,469 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:20:09,469 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:20:09,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-23 18:20:09,469 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:20:09,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:20:09,470 INFO L85 PathProgramCache]: Analyzing trace with hash -511795617, now seen corresponding path program 1 times [2024-11-23 18:20:09,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:20:09,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846779952] [2024-11-23 18:20:09,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:20:09,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:20:09,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:20:09,725 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-23 18:20:09,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:20:09,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846779952] [2024-11-23 18:20:09,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846779952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:20:09,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:20:09,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-23 18:20:09,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543164069] [2024-11-23 18:20:09,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:20:09,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 18:20:09,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:20:09,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 18:20:09,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 18:20:09,728 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:09,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:20:09,768 INFO L93 Difference]: Finished difference Result 210 states and 295 transitions. [2024-11-23 18:20:09,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 18:20:09,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-23 18:20:09,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:20:09,771 INFO L225 Difference]: With dead ends: 210 [2024-11-23 18:20:09,771 INFO L226 Difference]: Without dead ends: 108 [2024-11-23 18:20:09,771 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 [2024-11-23 18:20:09,772 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 1 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 18:20:09,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 400 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 18:20:09,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-23 18:20:09,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-23 18:20:09,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:20:09,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 149 transitions. [2024-11-23 18:20:09,791 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 149 transitions. Word has length 124 [2024-11-23 18:20:09,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:20:09,792 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 149 transitions. [2024-11-23 18:20:09,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:09,792 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 149 transitions. [2024-11-23 18:20:09,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-23 18:20:09,793 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:20:09,794 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:20:09,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-23 18:20:09,794 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:20:09,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:20:09,796 INFO L85 PathProgramCache]: Analyzing trace with hash -509948575, now seen corresponding path program 1 times [2024-11-23 18:20:09,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:20:09,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082266721] [2024-11-23 18:20:09,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:20:09,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:20:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:20:10,613 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-23 18:20:10,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:20:10,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082266721] [2024-11-23 18:20:10,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082266721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:20:10,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:20:10,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 18:20:10,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279324183] [2024-11-23 18:20:10,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:20:10,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 18:20:10,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:20:10,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 18:20:10,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 18:20:10,615 INFO L87 Difference]: Start difference. First operand 107 states and 149 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:11,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:20:11,183 INFO L93 Difference]: Finished difference Result 263 states and 366 transitions. [2024-11-23 18:20:11,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 18:20:11,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-23 18:20:11,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:20:11,186 INFO L225 Difference]: With dead ends: 263 [2024-11-23 18:20:11,186 INFO L226 Difference]: Without dead ends: 159 [2024-11-23 18:20:11,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-23 18:20:11,187 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 189 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-23 18:20:11,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 420 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-23 18:20:11,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-23 18:20:11,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 116. [2024-11-23 18:20:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 99 states have (on average 1.3333333333333333) internal successors, (132), 99 states have internal predecessors, (132), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:20:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2024-11-23 18:20:11,199 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 162 transitions. Word has length 124 [2024-11-23 18:20:11,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:20:11,199 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 162 transitions. [2024-11-23 18:20:11,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:11,200 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2024-11-23 18:20:11,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-23 18:20:11,204 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:20:11,204 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:20:11,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-23 18:20:11,205 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:20:11,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:20:11,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1378439380, now seen corresponding path program 1 times [2024-11-23 18:20:11,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:20:11,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15857887] [2024-11-23 18:20:11,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:20:11,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:20:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:20:12,416 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-23 18:20:12,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:20:12,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15857887] [2024-11-23 18:20:12,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15857887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:20:12,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:20:12,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 18:20:12,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189472182] [2024-11-23 18:20:12,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:20:12,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 18:20:12,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:20:12,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 18:20:12,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-23 18:20:12,423 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:13,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:20:13,102 INFO L93 Difference]: Finished difference Result 285 states and 398 transitions. [2024-11-23 18:20:13,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 18:20:13,105 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-11-23 18:20:13,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:20:13,107 INFO L225 Difference]: With dead ends: 285 [2024-11-23 18:20:13,109 INFO L226 Difference]: Without dead ends: 172 [2024-11-23 18:20:13,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-23 18:20:13,110 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 226 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-23 18:20:13,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 394 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-23 18:20:13,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-23 18:20:13,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 129. [2024-11-23 18:20:13,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.3482142857142858) internal successors, (151), 112 states have internal predecessors, (151), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:20:13,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 181 transitions. [2024-11-23 18:20:13,129 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 181 transitions. Word has length 125 [2024-11-23 18:20:13,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:20:13,129 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 181 transitions. [2024-11-23 18:20:13,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:13,130 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 181 transitions. [2024-11-23 18:20:13,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-23 18:20:13,131 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:20:13,132 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:20:13,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-23 18:20:13,132 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:20:13,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:20:13,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1244425874, now seen corresponding path program 1 times [2024-11-23 18:20:13,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:20:13,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724542376] [2024-11-23 18:20:13,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:20:13,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:20:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:20:13,642 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-23 18:20:13,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:20:13,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724542376] [2024-11-23 18:20:13,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724542376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:20:13,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:20:13,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 18:20:13,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13050404] [2024-11-23 18:20:13,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:20:13,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 18:20:13,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:20:13,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 18:20:13,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-23 18:20:13,644 INFO L87 Difference]: Start difference. First operand 129 states and 181 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:13,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:20:13,840 INFO L93 Difference]: Finished difference Result 257 states and 361 transitions. [2024-11-23 18:20:13,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 18:20:13,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 125 [2024-11-23 18:20:13,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:20:13,846 INFO L225 Difference]: With dead ends: 257 [2024-11-23 18:20:13,846 INFO L226 Difference]: Without dead ends: 131 [2024-11-23 18:20:13,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-23 18:20:13,847 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 27 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 18:20:13,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 345 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 18:20:13,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-23 18:20:13,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2024-11-23 18:20:13,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 112 states have internal predecessors, (150), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:20:13,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 180 transitions. [2024-11-23 18:20:13,864 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 180 transitions. Word has length 125 [2024-11-23 18:20:13,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:20:13,865 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 180 transitions. [2024-11-23 18:20:13,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:13,865 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 180 transitions. [2024-11-23 18:20:13,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-23 18:20:13,866 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:20:13,866 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:20:13,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-23 18:20:13,867 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:20:13,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:20:13,868 INFO L85 PathProgramCache]: Analyzing trace with hash -2064726594, now seen corresponding path program 1 times [2024-11-23 18:20:13,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:20:13,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788667719] [2024-11-23 18:20:13,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:20:13,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:20:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:20:14,756 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-23 18:20:14,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:20:14,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788667719] [2024-11-23 18:20:14,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788667719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:20:14,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:20:14,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 18:20:14,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988887821] [2024-11-23 18:20:14,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:20:14,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 18:20:14,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:20:14,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 18:20:14,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-23 18:20:14,760 INFO L87 Difference]: Start difference. First operand 129 states and 180 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:15,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:20:15,315 INFO L93 Difference]: Finished difference Result 300 states and 418 transitions. [2024-11-23 18:20:15,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 18:20:15,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-11-23 18:20:15,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:20:15,318 INFO L225 Difference]: With dead ends: 300 [2024-11-23 18:20:15,318 INFO L226 Difference]: Without dead ends: 174 [2024-11-23 18:20:15,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-23 18:20:15,319 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 237 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-23 18:20:15,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 274 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-23 18:20:15,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-23 18:20:15,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 131. [2024-11-23 18:20:15,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 114 states have (on average 1.3245614035087718) internal successors, (151), 114 states have internal predecessors, (151), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:20:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 181 transitions. [2024-11-23 18:20:15,330 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 181 transitions. Word has length 126 [2024-11-23 18:20:15,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:20:15,331 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 181 transitions. [2024-11-23 18:20:15,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:15,331 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 181 transitions. [2024-11-23 18:20:15,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-23 18:20:15,332 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:20:15,332 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:20:15,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-23 18:20:15,333 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:20:15,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:20:15,333 INFO L85 PathProgramCache]: Analyzing trace with hash 236095996, now seen corresponding path program 1 times [2024-11-23 18:20:15,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:20:15,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762389566] [2024-11-23 18:20:15,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:20:15,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:20:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:20:15,800 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-23 18:20:15,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:20:15,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762389566] [2024-11-23 18:20:15,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762389566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:20:15,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:20:15,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 18:20:15,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899892854] [2024-11-23 18:20:15,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:20:15,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 18:20:15,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:20:15,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 18:20:15,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-23 18:20:15,802 INFO L87 Difference]: Start difference. First operand 131 states and 181 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:16,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:20:16,078 INFO L93 Difference]: Finished difference Result 299 states and 412 transitions. [2024-11-23 18:20:16,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 18:20:16,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-11-23 18:20:16,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:20:16,080 INFO L225 Difference]: With dead ends: 299 [2024-11-23 18:20:16,080 INFO L226 Difference]: Without dead ends: 171 [2024-11-23 18:20:16,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-23 18:20:16,081 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 50 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 18:20:16,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 390 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 18:20:16,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-23 18:20:16,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 132. [2024-11-23 18:20:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 115 states have (on average 1.3217391304347825) internal successors, (152), 115 states have internal predecessors, (152), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:20:16,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 182 transitions. [2024-11-23 18:20:16,099 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 182 transitions. Word has length 126 [2024-11-23 18:20:16,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:20:16,100 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 182 transitions. [2024-11-23 18:20:16,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:16,100 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 182 transitions. [2024-11-23 18:20:16,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-23 18:20:16,103 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:20:16,103 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:20:16,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-23 18:20:16,104 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:20:16,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:20:16,105 INFO L85 PathProgramCache]: Analyzing trace with hash -519849880, now seen corresponding path program 1 times [2024-11-23 18:20:16,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:20:16,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597596471] [2024-11-23 18:20:16,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:20:16,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:20:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:20:17,029 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-23 18:20:17,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:20:17,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597596471] [2024-11-23 18:20:17,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597596471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:20:17,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:20:17,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 18:20:17,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334794629] [2024-11-23 18:20:17,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:20:17,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 18:20:17,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:20:17,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 18:20:17,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-23 18:20:17,034 INFO L87 Difference]: Start difference. First operand 132 states and 182 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:17,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:20:17,568 INFO L93 Difference]: Finished difference Result 310 states and 427 transitions. [2024-11-23 18:20:17,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 18:20:17,568 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 126 [2024-11-23 18:20:17,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:20:17,571 INFO L225 Difference]: With dead ends: 310 [2024-11-23 18:20:17,572 INFO L226 Difference]: Without dead ends: 181 [2024-11-23 18:20:17,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-23 18:20:17,574 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 235 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-23 18:20:17,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 425 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-23 18:20:17,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-23 18:20:17,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 136. [2024-11-23 18:20:17,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 119 states have internal predecessors, (158), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:20:17,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 188 transitions. [2024-11-23 18:20:17,593 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 188 transitions. Word has length 126 [2024-11-23 18:20:17,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:20:17,594 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 188 transitions. [2024-11-23 18:20:17,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:17,594 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 188 transitions. [2024-11-23 18:20:17,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-23 18:20:17,599 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:20:17,599 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:20:17,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-23 18:20:17,600 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:20:17,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:20:17,600 INFO L85 PathProgramCache]: Analyzing trace with hash 199899249, now seen corresponding path program 1 times [2024-11-23 18:20:17,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:20:17,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694747432] [2024-11-23 18:20:17,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:20:17,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:20:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:20:21,598 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-23 18:20:21,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:20:21,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694747432] [2024-11-23 18:20:21,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694747432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:20:21,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:20:21,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-23 18:20:21,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776458355] [2024-11-23 18:20:21,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:20:21,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-23 18:20:21,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:20:21,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-23 18:20:21,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-23 18:20:21,602 INFO L87 Difference]: Start difference. First operand 136 states and 188 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-23 18:20:23,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:20:23,041 INFO L93 Difference]: Finished difference Result 321 states and 442 transitions. [2024-11-23 18:20:23,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 18:20:23,043 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 127 [2024-11-23 18:20:23,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:20:23,045 INFO L225 Difference]: With dead ends: 321 [2024-11-23 18:20:23,046 INFO L226 Difference]: Without dead ends: 188 [2024-11-23 18:20:23,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2024-11-23 18:20:23,047 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 343 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-23 18:20:23,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 413 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-23 18:20:23,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-23 18:20:23,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 145. [2024-11-23 18:20:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 128 states have (on average 1.328125) internal successors, (170), 128 states have internal predecessors, (170), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:20:23,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 200 transitions. [2024-11-23 18:20:23,072 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 200 transitions. Word has length 127 [2024-11-23 18:20:23,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:20:23,073 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 200 transitions. [2024-11-23 18:20:23,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-23 18:20:23,073 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 200 transitions. [2024-11-23 18:20:23,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-23 18:20:23,076 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:20:23,077 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:20:23,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-23 18:20:23,077 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:20:23,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:20:23,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1744775963, now seen corresponding path program 1 times [2024-11-23 18:20:23,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:20:23,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908963887] [2024-11-23 18:20:23,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:20:23,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:20:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:20:24,157 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-23 18:20:24,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:20:24,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908963887] [2024-11-23 18:20:24,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908963887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:20:24,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:20:24,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 18:20:24,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292572640] [2024-11-23 18:20:24,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:20:24,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 18:20:24,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:20:24,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 18:20:24,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-23 18:20:24,160 INFO L87 Difference]: Start difference. First operand 145 states and 200 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:25,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:20:25,088 INFO L93 Difference]: Finished difference Result 334 states and 459 transitions. [2024-11-23 18:20:25,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 18:20:25,089 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 127 [2024-11-23 18:20:25,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:20:25,091 INFO L225 Difference]: With dead ends: 334 [2024-11-23 18:20:25,091 INFO L226 Difference]: Without dead ends: 192 [2024-11-23 18:20:25,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-23 18:20:25,092 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 159 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-23 18:20:25,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 438 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-23 18:20:25,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-23 18:20:25,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 147. [2024-11-23 18:20:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 130 states have (on average 1.3307692307692307) internal successors, (173), 130 states have internal predecessors, (173), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:20:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 203 transitions. [2024-11-23 18:20:25,114 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 203 transitions. Word has length 127 [2024-11-23 18:20:25,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:20:25,114 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 203 transitions. [2024-11-23 18:20:25,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:25,115 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 203 transitions. [2024-11-23 18:20:25,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-23 18:20:25,120 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:20:25,120 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:20:25,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-23 18:20:25,121 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:20:25,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:20:25,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1335042000, now seen corresponding path program 1 times [2024-11-23 18:20:25,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:20:25,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727907518] [2024-11-23 18:20:25,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:20:25,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:20:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:20:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-23 18:20:25,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:20:25,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727907518] [2024-11-23 18:20:25,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727907518] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:20:25,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987135323] [2024-11-23 18:20:25,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:20:25,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:20:25,372 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:20:25,374 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:20:25,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 18:20:25,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:20:25,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 18:20:25,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:20:25,765 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-23 18:20:25,765 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 18:20:25,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987135323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:20:25,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 18:20:25,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-23 18:20:25,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649168355] [2024-11-23 18:20:25,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:20:25,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 18:20:25,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:20:25,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 18:20:25,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-23 18:20:25,767 INFO L87 Difference]: Start difference. First operand 147 states and 203 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:25,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:20:25,819 INFO L93 Difference]: Finished difference Result 294 states and 407 transitions. [2024-11-23 18:20:25,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 18:20:25,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-11-23 18:20:25,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:20:25,822 INFO L225 Difference]: With dead ends: 294 [2024-11-23 18:20:25,822 INFO L226 Difference]: Without dead ends: 150 [2024-11-23 18:20:25,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-23 18:20:25,823 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 18:20:25,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 527 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 18:20:25,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-23 18:20:25,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-23 18:20:25,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 133 states have (on average 1.3233082706766917) internal successors, (176), 133 states have internal predecessors, (176), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:20:25,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 206 transitions. [2024-11-23 18:20:25,844 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 206 transitions. Word has length 128 [2024-11-23 18:20:25,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:20:25,845 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 206 transitions. [2024-11-23 18:20:25,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:25,845 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 206 transitions. [2024-11-23 18:20:25,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-23 18:20:25,847 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:20:25,847 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:20:25,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-23 18:20:26,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:20:26,048 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:20:26,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:20:26,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1305021189, now seen corresponding path program 1 times [2024-11-23 18:20:26,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:20:26,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673530701] [2024-11-23 18:20:26,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:20:26,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:20:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:20:26,819 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-23 18:20:26,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:20:26,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673530701] [2024-11-23 18:20:26,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673530701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:20:26,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:20:26,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 18:20:26,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758516491] [2024-11-23 18:20:26,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:20:26,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 18:20:26,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:20:26,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 18:20:26,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-23 18:20:26,821 INFO L87 Difference]: Start difference. First operand 150 states and 206 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:27,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:20:27,290 INFO L93 Difference]: Finished difference Result 341 states and 465 transitions. [2024-11-23 18:20:27,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 18:20:27,291 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 128 [2024-11-23 18:20:27,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:20:27,293 INFO L225 Difference]: With dead ends: 341 [2024-11-23 18:20:27,293 INFO L226 Difference]: Without dead ends: 194 [2024-11-23 18:20:27,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-23 18:20:27,295 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 261 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-23 18:20:27,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 331 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-23 18:20:27,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-23 18:20:27,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 146. [2024-11-23 18:20:27,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 129 states have (on average 1.317829457364341) internal successors, (170), 129 states have internal predecessors, (170), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:20:27,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 200 transitions. [2024-11-23 18:20:27,324 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 200 transitions. Word has length 128 [2024-11-23 18:20:27,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:20:27,324 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 200 transitions. [2024-11-23 18:20:27,325 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:20:27,325 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 200 transitions. [2024-11-23 18:20:27,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-23 18:20:27,327 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:20:27,327 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:20:27,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-23 18:20:27,327 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:20:27,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:20:27,328 INFO L85 PathProgramCache]: Analyzing trace with hash 62037240, now seen corresponding path program 1 times [2024-11-23 18:20:27,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:20:27,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385539739] [2024-11-23 18:20:27,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:20:27,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:20:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:20:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-23 18:20:31,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:20:31,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385539739] [2024-11-23 18:20:31,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385539739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:20:31,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:20:31,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-23 18:20:31,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258119278] [2024-11-23 18:20:31,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:20:31,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-23 18:20:31,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:20:31,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-23 18:20:31,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-23 18:20:31,462 INFO L87 Difference]: Start difference. First operand 146 states and 200 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-23 18:20:33,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:20:33,485 INFO L93 Difference]: Finished difference Result 342 states and 465 transitions. [2024-11-23 18:20:33,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 18:20:33,486 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 129 [2024-11-23 18:20:33,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:20:33,488 INFO L225 Difference]: With dead ends: 342 [2024-11-23 18:20:33,488 INFO L226 Difference]: Without dead ends: 199 [2024-11-23 18:20:33,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2024-11-23 18:20:33,489 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 165 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-23 18:20:33,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 509 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-23 18:20:33,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-23 18:20:33,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 148. [2024-11-23 18:20:33,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 131 states have (on average 1.3206106870229009) internal successors, (173), 131 states have internal predecessors, (173), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:20:33,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 203 transitions. [2024-11-23 18:20:33,517 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 203 transitions. Word has length 129 [2024-11-23 18:20:33,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:20:33,518 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 203 transitions. [2024-11-23 18:20:33,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-23 18:20:33,518 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 203 transitions. [2024-11-23 18:20:33,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-23 18:20:33,520 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:20:33,520 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:20:33,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-23 18:20:33,521 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:20:33,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:20:33,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1530403510, now seen corresponding path program 1 times [2024-11-23 18:20:33,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:20:33,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854807140] [2024-11-23 18:20:33,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:20:33,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:20:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:20:34,881 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-23 18:20:34,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 18:20:34,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854807140] [2024-11-23 18:20:34,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854807140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:20:34,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802739775] [2024-11-23 18:20:34,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:20:34,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:20:34,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:20:34,885 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 18:20:34,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-23 18:20:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:20:35,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-23 18:20:35,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:20:37,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-23 18:20:38,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-23 18:20:39,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-23 18:20:39,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:20:39,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2024-11-23 18:20:39,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:20:39,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:20:39,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:20:39,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:20:39,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:20:39,676 INFO L349 Elim1Store]: treesize reduction 90, result has 23.1 percent of original size [2024-11-23 18:20:39,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 49 [2024-11-23 18:20:39,699 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 153 proven. 65 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-23 18:20:39,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 18:20:39,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802739775] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 18:20:39,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-23 18:20:39,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2024-11-23 18:20:39,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240874076] [2024-11-23 18:20:39,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-23 18:20:39,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-23 18:20:39,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 18:20:39,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-23 18:20:39,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2024-11-23 18:20:39,942 INFO L87 Difference]: Start difference. First operand 148 states and 203 transitions. Second operand has 18 states, 16 states have (on average 6.125) internal successors, (98), 18 states have internal predecessors, (98), 8 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 8 states have call successors, (30) [2024-11-23 18:20:41,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:20:41,585 INFO L93 Difference]: Finished difference Result 333 states and 457 transitions. [2024-11-23 18:20:41,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-23 18:20:41,586 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.125) internal successors, (98), 18 states have internal predecessors, (98), 8 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 8 states have call successors, (30) Word has length 129 [2024-11-23 18:20:41,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:20:41,588 INFO L225 Difference]: With dead ends: 333 [2024-11-23 18:20:41,589 INFO L226 Difference]: Without dead ends: 188 [2024-11-23 18:20:41,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2024-11-23 18:20:41,590 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 402 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-23 18:20:41,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 384 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-23 18:20:41,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-23 18:20:41,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2024-11-23 18:20:41,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 147 states have (on average 1.2857142857142858) internal successors, (189), 148 states have internal predecessors, (189), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-23 18:20:41,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 239 transitions. [2024-11-23 18:20:41,630 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 239 transitions. Word has length 129 [2024-11-23 18:20:41,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:20:41,631 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 239 transitions. [2024-11-23 18:20:41,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.125) internal successors, (98), 18 states have internal predecessors, (98), 8 states have call successors, (30), 4 states have call predecessors, (30), 6 states have return successors, (30), 6 states have call predecessors, (30), 8 states have call successors, (30) [2024-11-23 18:20:41,632 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 239 transitions. [2024-11-23 18:20:41,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-23 18:20:41,634 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:20:41,634 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:20:41,647 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-23 18:20:41,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 18:20:41,836 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:20:41,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:20:41,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1507771256, now seen corresponding path program 1 times [2024-11-23 18:20:41,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 18:20:41,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151539871] [2024-11-23 18:20:41,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:20:41,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 18:20:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 18:20:42,047 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 18:20:42,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 18:20:42,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 18:20:42,330 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 18:20:42,332 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-23 18:20:42,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-23 18:20:42,338 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:20:42,561 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-23 18:20:42,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 06:20:42 BoogieIcfgContainer [2024-11-23 18:20:42,565 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-23 18:20:42,565 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 18:20:42,565 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 18:20:42,566 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 18:20:42,567 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:20:05" (3/4) ... [2024-11-23 18:20:42,569 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-23 18:20:42,570 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 18:20:42,571 INFO L158 Benchmark]: Toolchain (without parser) took 38360.55ms. Allocated memory was 117.4MB in the beginning and 662.7MB in the end (delta: 545.3MB). Free memory was 92.3MB in the beginning and 324.1MB in the end (delta: -231.8MB). Peak memory consumption was 318.1MB. Max. memory is 16.1GB. [2024-11-23 18:20:42,571 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 117.4MB. Free memory is still 72.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 18:20:42,571 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.36ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 76.8MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-23 18:20:42,572 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.46ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 73.4MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 18:20:42,572 INFO L158 Benchmark]: Boogie Preprocessor took 80.42ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 70.6MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 18:20:42,572 INFO L158 Benchmark]: RCFGBuilder took 1018.87ms. Allocated memory is still 117.4MB. Free memory was 70.6MB in the beginning and 38.7MB in the end (delta: 31.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-23 18:20:42,572 INFO L158 Benchmark]: TraceAbstraction took 36663.19ms. Allocated memory was 117.4MB in the beginning and 662.7MB in the end (delta: 545.3MB). Free memory was 91.4MB in the beginning and 324.2MB in the end (delta: -232.8MB). Peak memory consumption was 304.3MB. Max. memory is 16.1GB. [2024-11-23 18:20:42,573 INFO L158 Benchmark]: Witness Printer took 4.69ms. Allocated memory is still 662.7MB. Free memory was 324.2MB in the beginning and 324.1MB in the end (delta: 90.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 18:20:42,574 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.42ms. Allocated memory is still 117.4MB. Free memory is still 72.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 470.36ms. Allocated memory is still 117.4MB. Free memory was 92.0MB in the beginning and 76.8MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.46ms. Allocated memory is still 117.4MB. Free memory was 76.8MB in the beginning and 73.4MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 80.42ms. Allocated memory is still 117.4MB. Free memory was 73.4MB in the beginning and 70.6MB in the end (delta: 2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1018.87ms. Allocated memory is still 117.4MB. Free memory was 70.6MB in the beginning and 38.7MB in the end (delta: 31.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 36663.19ms. Allocated memory was 117.4MB in the beginning and 662.7MB in the end (delta: 545.3MB). Free memory was 91.4MB in the beginning and 324.2MB in the end (delta: -232.8MB). Peak memory consumption was 304.3MB. Max. memory is 16.1GB. * Witness Printer took 4.69ms. Allocated memory is still 662.7MB. Free memory was 324.2MB in the beginning and 324.1MB in the end (delta: 90.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryArithmeticDOUBLEoperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryFLOATComparisonOperation at line 116, overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 89. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 32, 0, 16, 4, 0, 0, 55182, 0, 1, 1, 100, 2.25, 199.4, -128 }; [L55] signed char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L56] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L57] signed char* WrapperStruct00_var_1_4_Pointer = &(WrapperStruct00.var_1_4); [L58] signed char* WrapperStruct00_var_1_5_Pointer = &(WrapperStruct00.var_1_5); [L59] signed char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L60] unsigned short int* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L61] unsigned short int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L62] unsigned char* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L63] unsigned char* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L64] unsigned char* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L65] unsigned char* WrapperStruct00_var_1_16_Pointer = &(WrapperStruct00.var_1_16); [L66] float* WrapperStruct00_var_1_17_Pointer = &(WrapperStruct00.var_1_17); [L67] float* WrapperStruct00_var_1_18_Pointer = &(WrapperStruct00.var_1_18); [L68] signed char* WrapperStruct00_var_1_19_Pointer = &(WrapperStruct00.var_1_19); VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=0] [L125] isInitial = 1 [L126] FCALL initially() [L128] FCALL updateLastVariables() [L129] CALL updateVariables() [L94] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L96] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L97] WrapperStruct00.var_1_4 = __VERIFIER_nondet_char() [L98] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= -1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L99] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L100] WrapperStruct00.var_1_5 = __VERIFIER_nondet_char() [L101] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L102] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L103] WrapperStruct00.var_1_6 = __VERIFIER_nondet_char() [L104] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L105] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L106] WrapperStruct00.var_1_10 = __VERIFIER_nondet_ushort() [L107] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 32767) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L108] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 65534) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L109] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L110] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L111] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L112] WrapperStruct00.var_1_15 = __VERIFIER_nondet_uchar() [L113] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L114] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L115] WrapperStruct00.var_1_18 = __VERIFIER_nondet_float() [L116] EXPR WrapperStruct00.var_1_18 [L116] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F [L116] EXPR WrapperStruct00.var_1_18 [L116] EXPR WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L116] EXPR (WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L116] CALL assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, \old(cond)=1, isInitial=1] [L116] RET assume_abort_if_not((WrapperStruct00.var_1_18 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_18 <= -1.0e-20F) || (WrapperStruct00.var_1_18 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_18 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L129] RET updateVariables() [L130] CALL step() [L72] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L72] COND FALSE !(! (*(WrapperStruct00_var_1_2_Pointer))) [L75] EXPR \read(*WrapperStruct00_var_1_15_Pointer) [L75] (*(WrapperStruct00_var_1_12_Pointer)) = ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0))) [L77] EXPR \read(*WrapperStruct00_var_1_5_Pointer) [L77] (*(WrapperStruct00_var_1_16_Pointer)) = (*(WrapperStruct00_var_1_5_Pointer)) [L78] EXPR \read(*WrapperStruct00_var_1_18_Pointer) [L78] (*(WrapperStruct00_var_1_17_Pointer)) = (*(WrapperStruct00_var_1_18_Pointer)) [L79] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L79] (*(WrapperStruct00_var_1_19_Pointer)) = (*(WrapperStruct00_var_1_4_Pointer)) [L80] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L80] (*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer))) [L80] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L80] (*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L80] COND TRUE (*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer))) [L81] EXPR \read(*WrapperStruct00_var_1_12_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L81] COND FALSE !((*(WrapperStruct00_var_1_12_Pointer))) [L84] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L84] EXPR \read(*WrapperStruct00_var_1_5_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L84] EXPR (((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))) [L84] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L84] EXPR (((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L84] EXPR \read(*WrapperStruct00_var_1_6_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L84] EXPR (((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer))) [L84] EXPR \read(*WrapperStruct00_var_1_6_Pointer) [L84] EXPR (((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L84] (*(WrapperStruct00_var_1_1_Pointer)) = (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer))))) [L89] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_17_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L89] EXPR ((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)) [L89] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L89] EXPR ((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L89] EXPR \read(*WrapperStruct00_var_1_17_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L89] COND FALSE !(((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L121] EXPR (*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer))) [L121] EXPR \read(*WrapperStruct00_var_1_17_Pointer) [L121] EXPR (*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR ((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer)))) [L121] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L121] EXPR \read(*WrapperStruct00_var_1_4_Pointer) [L121] EXPR ((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR (((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR ((((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1)) && ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0)))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR (((((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1)) && ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_5_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR ((((((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1)) && ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_18_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121] EXPR (((((((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1)) && ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_18_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L121-L122] return (((((((*(WrapperStruct00_var_1_12_Pointer)) || (64.75f < (*(WrapperStruct00_var_1_17_Pointer)))) ? ((*(WrapperStruct00_var_1_12_Pointer)) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) ((*(WrapperStruct00_var_1_4_Pointer)) - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (((((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) < ((*(WrapperStruct00_var_1_6_Pointer)))) ? ((((((*(WrapperStruct00_var_1_4_Pointer))) > ((*(WrapperStruct00_var_1_5_Pointer)))) ? ((*(WrapperStruct00_var_1_4_Pointer))) : ((*(WrapperStruct00_var_1_5_Pointer)))))) : ((*(WrapperStruct00_var_1_6_Pointer)))))))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer))))) && ((((((((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) > (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4))) ? (((*(WrapperStruct00_var_1_17_Pointer)) * 127.75)) : (((*(WrapperStruct00_var_1_17_Pointer)) / 3.4)))) >= (*(WrapperStruct00_var_1_17_Pointer))) ? ((*(WrapperStruct00_var_1_7_Pointer)) == ((unsigned short int) ((((((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) < ((*(WrapperStruct00_var_1_16_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) - (22925 - (*(WrapperStruct00_var_1_5_Pointer))))) : ((*(WrapperStruct00_var_1_16_Pointer))))))) : 1)) && ((! (*(WrapperStruct00_var_1_2_Pointer))) ? ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_12_Pointer)) == ((unsigned char) ((! (*(WrapperStruct00_var_1_15_Pointer))) || (! (! 0))))))) && ((*(WrapperStruct00_var_1_16_Pointer)) == ((unsigned char) (*(WrapperStruct00_var_1_5_Pointer))))) && ((*(WrapperStruct00_var_1_17_Pointer)) == ((float) (*(WrapperStruct00_var_1_18_Pointer))))) && ((*(WrapperStruct00_var_1_19_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_4_Pointer)))) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:7}, WrapperStruct00_var_1_12_Pointer={4:9}, WrapperStruct00_var_1_14_Pointer={4:10}, WrapperStruct00_var_1_15_Pointer={4:11}, WrapperStruct00_var_1_16_Pointer={4:12}, WrapperStruct00_var_1_17_Pointer={4:13}, WrapperStruct00_var_1_18_Pointer={4:17}, WrapperStruct00_var_1_19_Pointer={4:21}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_4_Pointer={4:2}, WrapperStruct00_var_1_5_Pointer={4:3}, WrapperStruct00_var_1_6_Pointer={4:4}, WrapperStruct00_var_1_7_Pointer={4:5}, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.3s, OverallIterations: 20, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2309 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2297 mSDsluCounter, 7124 SdHoareTripleChecker+Invalid, 6.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4736 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3909 IncrementalHoareTripleChecker+Invalid, 4083 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 2388 mSDtfsCounter, 3909 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 578 GetRequests, 452 SyntacticMatches, 5 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=175occurred in iteration=19, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 418 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 20.9s InterpolantComputationTime, 2898 NumberOfCodeBlocks, 2898 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2747 ConstructedInterpolants, 0 QuantifiedInterpolants, 17480 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1580 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 22 InterpolantComputations, 18 PerfectInterpolantSequences, 9093/9240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-23 18:20:42,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eec8f8284372b98229413b7ee99f903f6568b9039ed1b67a16348dd2452d2dbd --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 18:20:45,567 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 18:20:45,712 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-23 18:20:45,722 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 18:20:45,722 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 18:20:45,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 18:20:45,768 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 18:20:45,768 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 18:20:45,769 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 18:20:45,769 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 18:20:45,769 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 18:20:45,769 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 18:20:45,770 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 18:20:45,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 18:20:45,771 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 18:20:45,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 18:20:45,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 18:20:45,773 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-23 18:20:45,773 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-23 18:20:45,773 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 18:20:45,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 18:20:45,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 18:20:45,773 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 18:20:45,773 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-23 18:20:45,773 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-23 18:20:45,773 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-23 18:20:45,773 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-23 18:20:45,773 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 18:20:45,774 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 18:20:45,774 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 18:20:45,774 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 18:20:45,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 18:20:45,774 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 18:20:45,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 18:20:45,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 18:20:45,774 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 18:20:45,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 18:20:45,774 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 18:20:45,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 18:20:45,775 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 18:20:45,775 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 18:20:45,775 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 18:20:45,775 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-23 18:20:45,775 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 18:20:45,775 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-23 18:20:45,775 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-23 18:20:45,775 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 18:20:45,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 18:20:45,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 18:20:45,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 18:20:45,777 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eec8f8284372b98229413b7ee99f903f6568b9039ed1b67a16348dd2452d2dbd [2024-11-23 18:20:46,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 18:20:46,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 18:20:46,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 18:20:46,138 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 18:20:46,138 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 18:20:46,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i [2024-11-23 18:20:49,206 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/data/26074ed3a/1ffd93826cd046ab8111dd202400c921/FLAGc919f9b17 [2024-11-23 18:20:49,516 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 18:20:49,522 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i [2024-11-23 18:20:49,533 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/data/26074ed3a/1ffd93826cd046ab8111dd202400c921/FLAGc919f9b17 [2024-11-23 18:20:49,556 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/data/26074ed3a/1ffd93826cd046ab8111dd202400c921 [2024-11-23 18:20:49,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 18:20:49,561 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 18:20:49,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 18:20:49,564 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 18:20:49,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 18:20:49,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:20:49" (1/1) ... [2024-11-23 18:20:49,569 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22d0baa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:49, skipping insertion in model container [2024-11-23 18:20:49,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 06:20:49" (1/1) ... [2024-11-23 18:20:49,594 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 18:20:49,763 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i[917,930] [2024-11-23 18:20:49,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 18:20:49,855 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 18:20:49,867 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-24.i[917,930] [2024-11-23 18:20:49,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 18:20:49,957 INFO L204 MainTranslator]: Completed translation [2024-11-23 18:20:49,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:49 WrapperNode [2024-11-23 18:20:49,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 18:20:49,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 18:20:49,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 18:20:49,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 18:20:49,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:49" (1/1) ... [2024-11-23 18:20:49,990 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:49" (1/1) ... [2024-11-23 18:20:50,025 INFO L138 Inliner]: procedures = 34, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 466 [2024-11-23 18:20:50,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 18:20:50,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 18:20:50,026 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 18:20:50,026 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 18:20:50,036 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:49" (1/1) ... [2024-11-23 18:20:50,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:49" (1/1) ... [2024-11-23 18:20:50,043 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:49" (1/1) ... [2024-11-23 18:20:50,062 INFO L175 MemorySlicer]: Split 127 memory accesses to 2 slices as follows [2, 125]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 32 writes are split as follows [0, 32]. [2024-11-23 18:20:50,063 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:49" (1/1) ... [2024-11-23 18:20:50,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:49" (1/1) ... [2024-11-23 18:20:50,080 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:49" (1/1) ... [2024-11-23 18:20:50,081 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:49" (1/1) ... [2024-11-23 18:20:50,086 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:49" (1/1) ... [2024-11-23 18:20:50,093 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:49" (1/1) ... [2024-11-23 18:20:50,099 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:49" (1/1) ... [2024-11-23 18:20:50,108 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 18:20:50,109 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 18:20:50,109 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 18:20:50,109 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 18:20:50,110 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:49" (1/1) ... [2024-11-23 18:20:50,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 18:20:50,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 18:20:50,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 18:20:50,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 18:20:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 18:20:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-23 18:20:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-23 18:20:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-23 18:20:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-23 18:20:50,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-23 18:20:50,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-23 18:20:50,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-23 18:20:50,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-23 18:20:50,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-23 18:20:50,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-23 18:20:50,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-23 18:20:50,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-23 18:20:50,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-23 18:20:50,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-23 18:20:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-23 18:20:50,184 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-23 18:20:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-23 18:20:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-23 18:20:50,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 18:20:50,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 18:20:50,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-23 18:20:50,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-23 18:20:50,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-23 18:20:50,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-23 18:20:50,383 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 18:20:50,386 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 18:21:09,083 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-11-23 18:21:09,083 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 18:21:09,094 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 18:21:09,095 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-23 18:21:09,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:21:09 BoogieIcfgContainer [2024-11-23 18:21:09,095 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 18:21:09,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 18:21:09,098 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 18:21:09,103 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 18:21:09,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 06:20:49" (1/3) ... [2024-11-23 18:21:09,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d74ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:21:09, skipping insertion in model container [2024-11-23 18:21:09,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 06:20:49" (2/3) ... [2024-11-23 18:21:09,104 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10d74ebd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 06:21:09, skipping insertion in model container [2024-11-23 18:21:09,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 06:21:09" (3/3) ... [2024-11-23 18:21:09,107 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-24.i [2024-11-23 18:21:09,121 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 18:21:09,122 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-sp_file-24.i that has 2 procedures, 101 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-23 18:21:09,170 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 18:21:09,180 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;@702f5fad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 18:21:09,181 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-23 18:21:09,185 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:21:09,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-23 18:21:09,195 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:21:09,196 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:21:09,197 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:21:09,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:21:09,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1133390607, now seen corresponding path program 1 times [2024-11-23 18:21:09,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 18:21:09,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704576936] [2024-11-23 18:21:09,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:21:09,213 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 [2024-11-23 18:21:09,213 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-23 18:21:09,218 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/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) [2024-11-23 18:21:09,219 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/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 [2024-11-23 18:21:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:21:10,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-23 18:21:10,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:21:10,601 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-23 18:21:10,601 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 18:21:10,602 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 18:21:10,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704576936] [2024-11-23 18:21:10,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704576936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:21:10,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:21:10,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-23 18:21:10,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765604049] [2024-11-23 18:21:10,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:21:10,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-23 18:21:10,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 18:21:10,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-23 18:21:10,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 18:21:10,636 INFO L87 Difference]: Start difference. First operand has 101 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 84 states have internal predecessors, (116), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-23 18:21:10,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:21:10,679 INFO L93 Difference]: Finished difference Result 195 states and 301 transitions. [2024-11-23 18:21:10,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-23 18:21:10,683 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-11-23 18:21:10,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:21:10,690 INFO L225 Difference]: With dead ends: 195 [2024-11-23 18:21:10,690 INFO L226 Difference]: Without dead ends: 97 [2024-11-23 18:21:10,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 18:21:10,696 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 18:21:10,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 18:21:10,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-23 18:21:10,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-23 18:21:10,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:21:10,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-11-23 18:21:10,736 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 124 [2024-11-23 18:21:10,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:21:10,740 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-11-23 18:21:10,741 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-23 18:21:10,741 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-11-23 18:21:10,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-23 18:21:10,744 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:21:10,744 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:21:10,773 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/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 [2024-11-23 18:21:10,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/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 [2024-11-23 18:21:10,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:21:10,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:21:10,946 INFO L85 PathProgramCache]: Analyzing trace with hash -191984407, now seen corresponding path program 1 times [2024-11-23 18:21:10,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 18:21:10,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884706285] [2024-11-23 18:21:10,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:21:10,947 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 [2024-11-23 18:21:10,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-23 18:21:10,949 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/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) [2024-11-23 18:21:10,951 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/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 [2024-11-23 18:21:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:21:12,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 18:21:12,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:21:12,502 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-23 18:21:12,502 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 18:21:12,502 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 18:21:12,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1884706285] [2024-11-23 18:21:12,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1884706285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:21:12,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:21:12,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 18:21:12,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868006612] [2024-11-23 18:21:12,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:21:12,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 18:21:12,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 18:21:12,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 18:21:12,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 18:21:12,507 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:21:12,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:21:12,694 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2024-11-23 18:21:12,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 18:21:12,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-23 18:21:12,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:21:12,698 INFO L225 Difference]: With dead ends: 192 [2024-11-23 18:21:12,698 INFO L226 Difference]: Without dead ends: 98 [2024-11-23 18:21:12,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 18:21:12,700 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 18:21:12,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 18:21:12,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-23 18:21:12,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-23 18:21:12,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:21:12,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2024-11-23 18:21:12,719 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 124 [2024-11-23 18:21:12,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:21:12,721 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2024-11-23 18:21:12,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:21:12,722 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2024-11-23 18:21:12,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-23 18:21:12,724 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:21:12,724 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:21:12,751 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-23 18:21:12,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/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 [2024-11-23 18:21:12,929 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:21:12,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:21:12,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1997422741, now seen corresponding path program 1 times [2024-11-23 18:21:12,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 18:21:12,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2063140282] [2024-11-23 18:21:12,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:21:12,932 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 [2024-11-23 18:21:12,932 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-23 18:21:12,934 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/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) [2024-11-23 18:21:12,936 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/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 [2024-11-23 18:21:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:21:14,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-23 18:21:14,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:21:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-23 18:21:14,379 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 18:21:14,380 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 18:21:14,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2063140282] [2024-11-23 18:21:14,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2063140282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:21:14,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:21:14,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-23 18:21:14,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810414207] [2024-11-23 18:21:14,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:21:14,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-23 18:21:14,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 18:21:14,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-23 18:21:14,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 18:21:14,383 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:21:14,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:21:14,544 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2024-11-23 18:21:14,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-23 18:21:14,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-23 18:21:14,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:21:14,549 INFO L225 Difference]: With dead ends: 194 [2024-11-23 18:21:14,551 INFO L226 Difference]: Without dead ends: 99 [2024-11-23 18:21:14,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-23 18:21:14,553 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 18:21:14,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 270 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 18:21:14,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-23 18:21:14,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-23 18:21:14,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:21:14,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-23 18:21:14,573 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 124 [2024-11-23 18:21:14,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:21:14,574 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-23 18:21:14,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:21:14,574 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-23 18:21:14,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-23 18:21:14,576 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:21:14,577 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:21:14,602 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/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)] Forceful destruction successful, exit code 0 [2024-11-23 18:21:14,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/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 [2024-11-23 18:21:14,778 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:21:14,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:21:14,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1276476201, now seen corresponding path program 1 times [2024-11-23 18:21:14,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 18:21:14,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399743665] [2024-11-23 18:21:14,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:21:14,779 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 [2024-11-23 18:21:14,779 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-23 18:21:14,783 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/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) [2024-11-23 18:21:14,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/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 [2024-11-23 18:21:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:21:16,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-23 18:21:16,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:21:16,596 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-23 18:21:16,596 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 18:21:16,596 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 18:21:16,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399743665] [2024-11-23 18:21:16,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399743665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:21:16,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:21:16,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-23 18:21:16,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152119502] [2024-11-23 18:21:16,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:21:16,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-23 18:21:16,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 18:21:16,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-23 18:21:16,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 18:21:16,599 INFO L87 Difference]: Start difference. First operand 99 states and 141 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:21:17,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:21:17,208 INFO L93 Difference]: Finished difference Result 200 states and 286 transitions. [2024-11-23 18:21:17,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-23 18:21:17,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-23 18:21:17,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:21:17,211 INFO L225 Difference]: With dead ends: 200 [2024-11-23 18:21:17,211 INFO L226 Difference]: Without dead ends: 104 [2024-11-23 18:21:17,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 18:21:17,213 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 1 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 520 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.6s IncrementalHoareTripleChecker+Time [2024-11-23 18:21:17,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 520 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-23 18:21:17,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-23 18:21:17,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-11-23 18:21:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:21:17,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 145 transitions. [2024-11-23 18:21:17,224 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 145 transitions. Word has length 124 [2024-11-23 18:21:17,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:21:17,225 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 145 transitions. [2024-11-23 18:21:17,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:21:17,225 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 145 transitions. [2024-11-23 18:21:17,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-23 18:21:17,228 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:21:17,228 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:21:17,257 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-23 18:21:17,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/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 [2024-11-23 18:21:17,429 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:21:17,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:21:17,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1956534571, now seen corresponding path program 1 times [2024-11-23 18:21:17,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 18:21:17,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576857866] [2024-11-23 18:21:17,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:21:17,430 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 [2024-11-23 18:21:17,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-23 18:21:17,434 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/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) [2024-11-23 18:21:17,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-23 18:21:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:21:18,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-23 18:21:18,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:21:19,347 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-23 18:21:19,348 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 18:21:19,348 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 18:21:19,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576857866] [2024-11-23 18:21:19,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [576857866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:21:19,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:21:19,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 18:21:19,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234319547] [2024-11-23 18:21:19,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:21:19,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 18:21:19,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 18:21:19,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 18:21:19,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 18:21:19,351 INFO L87 Difference]: Start difference. First operand 103 states and 145 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:21:20,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:21:20,160 INFO L93 Difference]: Finished difference Result 206 states and 291 transitions. [2024-11-23 18:21:20,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 18:21:20,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-23 18:21:20,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:21:20,163 INFO L225 Difference]: With dead ends: 206 [2024-11-23 18:21:20,164 INFO L226 Difference]: Without dead ends: 106 [2024-11-23 18:21:20,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 18:21:20,167 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-23 18:21:20,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 640 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-23 18:21:20,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-23 18:21:20,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-23 18:21:20,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:21:20,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 147 transitions. [2024-11-23 18:21:20,188 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 147 transitions. Word has length 124 [2024-11-23 18:21:20,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:21:20,191 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 147 transitions. [2024-11-23 18:21:20,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:21:20,191 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 147 transitions. [2024-11-23 18:21:20,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-23 18:21:20,193 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:21:20,193 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:21:20,220 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-23 18:21:20,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/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 [2024-11-23 18:21:20,394 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:21:20,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:21:20,395 INFO L85 PathProgramCache]: Analyzing trace with hash -563425363, now seen corresponding path program 1 times [2024-11-23 18:21:20,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 18:21:20,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2017168406] [2024-11-23 18:21:20,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:21:20,396 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 [2024-11-23 18:21:20,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-23 18:21:20,398 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/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) [2024-11-23 18:21:20,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-23 18:21:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:21:21,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 18:21:21,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:21:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-23 18:21:22,627 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 18:21:22,627 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 18:21:22,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2017168406] [2024-11-23 18:21:22,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2017168406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:21:22,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:21:22,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 18:21:22,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079068618] [2024-11-23 18:21:22,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:21:22,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 18:21:22,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 18:21:22,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 18:21:22,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-23 18:21:22,630 INFO L87 Difference]: Start difference. First operand 105 states and 147 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:21:23,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:21:23,644 INFO L93 Difference]: Finished difference Result 210 states and 295 transitions. [2024-11-23 18:21:23,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 18:21:23,645 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-23 18:21:23,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:21:23,647 INFO L225 Difference]: With dead ends: 210 [2024-11-23 18:21:23,647 INFO L226 Difference]: Without dead ends: 108 [2024-11-23 18:21:23,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-23 18:21:23,649 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 1 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-23 18:21:23,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 761 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-23 18:21:23,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-23 18:21:23,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2024-11-23 18:21:23,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 90 states have (on average 1.3222222222222222) internal successors, (119), 90 states have internal predecessors, (119), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-23 18:21:23,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 149 transitions. [2024-11-23 18:21:23,660 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 149 transitions. Word has length 124 [2024-11-23 18:21:23,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:21:23,661 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 149 transitions. [2024-11-23 18:21:23,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:21:23,661 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 149 transitions. [2024-11-23 18:21:23,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-23 18:21:23,663 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:21:23,664 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:21:23,688 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-23 18:21:23,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/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 [2024-11-23 18:21:23,864 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:21:23,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:21:23,865 INFO L85 PathProgramCache]: Analyzing trace with hash -561578321, now seen corresponding path program 1 times [2024-11-23 18:21:23,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 18:21:23,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134633855] [2024-11-23 18:21:23,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:21:23,866 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 [2024-11-23 18:21:23,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-23 18:21:23,868 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/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) [2024-11-23 18:21:23,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/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 (8)] Waiting until timeout for monitored process [2024-11-23 18:21:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:21:26,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-23 18:21:26,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:21:37,865 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:21:45,970 WARN L286 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:21:54,253 WARN L286 SmtUtils]: Spent 8.28s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:22:01,713 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (= |c_ULTIMATE.start_step_#t~ite34#1| .cse0) (fp.gt .cse0 (fp.div c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-23 18:22:08,967 WARN L286 SmtUtils]: Spent 7.25s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:22:17,077 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:22:25,219 WARN L286 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:22:33,517 WARN L286 SmtUtils]: Spent 8.30s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:22:37,560 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (let ((.cse3 (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode .cse1))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (= |c_ULTIMATE.start_step_#t~ite34#1| .cse0) (= .cse1 |c_ULTIMATE.start_step_#t~mem35#1|) (fp.gt .cse0 (fp.div c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (= c_currentRoundingMode roundNearestTiesToEven))))) is different from false [2024-11-23 18:22:46,160 WARN L286 SmtUtils]: Spent 5.33s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:22:54,319 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:23:02,632 WARN L286 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:23:06,689 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (fp.gt .cse0 (fp.div c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (not (fp.geq .cse0 .cse1)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2024-11-23 18:23:10,767 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse2 (select (select |c_#memory_int#1| c_~WrapperStruct00_var_1_17_Pointer~0.base) c_~WrapperStruct00_var_1_17_Pointer~0.offset))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (let ((.cse0 (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 511.0 4.0))))) (and (fp.gt .cse0 (fp.div c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 17.0 5.0)))) (not (fp.geq .cse0 .cse1)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2024-11-23 18:23:18,880 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:23:27,034 WARN L286 SmtUtils]: Spent 8.15s on a formula simplification that was a NOOP. DAG size: 16 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:23:35,361 WARN L286 SmtUtils]: Spent 8.33s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:23:35,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 84 [2024-11-23 18:23:47,715 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:23:54,027 WARN L286 SmtUtils]: Spent 6.31s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:24:02,202 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:24:14,139 WARN L851 $PredicateComparison]: unable to prove that (and (not |c_ULTIMATE.start_property_#t~short74#1|) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven .cse0))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 511.0 4.0))))) (and (not (fp.lt ((_ to_fp 8 24) roundNearestTiesToEven (/ 259.0 4.0)) .cse0)) (fp.gt .cse1 (fp.div roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 17.0 5.0)))) (not (fp.geq .cse1 .cse2)))))))) is different from false [2024-11-23 18:24:18,176 WARN L873 $PredicateComparison]: unable to prove that (and (not |c_ULTIMATE.start_property_#t~short74#1|) (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven .cse0))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 511.0 4.0))))) (and (not (fp.lt ((_ to_fp 8 24) roundNearestTiesToEven (/ 259.0 4.0)) .cse0)) (fp.gt .cse1 (fp.div roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 17.0 5.0)))) (not (fp.geq .cse1 .cse2)))))))) is different from true [2024-11-23 18:24:30,398 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:24:38,505 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:24:46,692 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:24:50,746 WARN L851 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven .cse0))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 511.0 4.0))))) (and (not (fp.lt ((_ to_fp 8 24) roundNearestTiesToEven (/ 259.0 4.0)) .cse0)) (fp.gt .cse1 (fp.div roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 17.0 5.0)))) (not (fp.geq .cse1 .cse2))))))) is different from false [2024-11-23 18:24:54,784 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven .cse0))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 511.0 4.0))))) (and (not (fp.lt ((_ to_fp 8 24) roundNearestTiesToEven (/ 259.0 4.0)) .cse0)) (fp.gt .cse1 (fp.div roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 17.0 5.0)))) (not (fp.geq .cse1 .cse2))))))) is different from true [2024-11-23 18:25:07,011 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:25:14,647 WARN L286 SmtUtils]: Spent 7.64s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:25:22,824 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:25:35,059 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:25:43,173 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:25:51,347 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:26:03,574 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:26:09,429 WARN L286 SmtUtils]: Spent 5.86s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:26:17,599 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:26:28,067 WARN L286 SmtUtils]: Spent 6.41s on a formula simplification. DAG size of input: 10 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:26:36,187 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:26:44,371 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:26:48,414 WARN L851 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 511.0 4.0))))) (and (fp.gt .cse0 (fp.div roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 17.0 5.0)))) (not (fp.geq .cse0 .cse1)))))) is different from false [2024-11-23 18:26:52,457 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 511.0 4.0))))) (and (fp.gt .cse0 (fp.div roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 17.0 5.0)))) (not (fp.geq .cse0 .cse1)))))) is different from true [2024-11-23 18:27:04,634 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:27:12,812 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:27:24,985 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:27:33,168 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:27:45,359 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:27:53,523 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:28:05,700 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:28:13,882 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:28:26,049 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:28:33,651 WARN L286 SmtUtils]: Spent 7.60s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:28:45,815 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:28:53,986 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:29:06,155 WARN L286 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:29:14,356 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:29:26,029 WARN L286 SmtUtils]: Spent 7.61s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:29:32,658 WARN L286 SmtUtils]: Spent 6.63s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:29:44,816 WARN L286 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:29:52,996 WARN L286 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-23 18:29:52,997 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-23 18:29:52,997 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 18:29:52,997 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-23 18:29:52,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134633855] [2024-11-23 18:29:52,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1134633855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 18:29:52,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 18:29:52,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-23 18:29:52,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542385934] [2024-11-23 18:29:52,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 18:29:52,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-23 18:29:52,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-23 18:29:52,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-23 18:29:52,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=8, Unknown=10, NotChecked=54, Total=90 [2024-11-23 18:29:52,999 INFO L87 Difference]: Start difference. First operand 107 states and 149 transitions. Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:29:58,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-23 18:30:03,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-23 18:30:07,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-23 18:30:11,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-23 18:30:17,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-23 18:30:21,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-23 18:30:25,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-23 18:30:29,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-23 18:30:34,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-23 18:30:38,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-23 18:30:43,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-23 18:30:47,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-23 18:30:53,033 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-23 18:30:57,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-23 18:31:01,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-23 18:31:05,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-23 18:31:06,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 18:31:06,045 INFO L93 Difference]: Finished difference Result 231 states and 319 transitions. [2024-11-23 18:31:06,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-23 18:31:06,050 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 124 [2024-11-23 18:31:06,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 18:31:06,052 INFO L225 Difference]: With dead ends: 231 [2024-11-23 18:31:06,052 INFO L226 Difference]: Without dead ends: 229 [2024-11-23 18:31:06,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 47.3s TimeCoverageRelationStatistics Valid=18, Invalid=8, Unknown=10, NotChecked=54, Total=90 [2024-11-23 18:31:06,053 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 77 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 0 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 71.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 1931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 1773 IncrementalHoareTripleChecker+Unchecked, 73.0s IncrementalHoareTripleChecker+Time [2024-11-23 18:31:06,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 391 Invalid, 1931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 142 Invalid, 16 Unknown, 1773 Unchecked, 73.0s Time] [2024-11-23 18:31:06,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-23 18:31:06,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2024-11-23 18:31:06,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 194 states have (on average 1.3195876288659794) internal successors, (256), 194 states have internal predecessors, (256), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-23 18:31:06,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 316 transitions. [2024-11-23 18:31:06,075 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 316 transitions. Word has length 124 [2024-11-23 18:31:06,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 18:31:06,075 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 316 transitions. [2024-11-23 18:31:06,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-23 18:31:06,076 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 316 transitions. [2024-11-23 18:31:06,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-23 18:31:06,078 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 18:31:06,078 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 18:31:06,106 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/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 (8)] Ended with exit code 0 [2024-11-23 18:31:06,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/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 [2024-11-23 18:31:06,279 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 18:31:06,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 18:31:06,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1379226771, now seen corresponding path program 1 times [2024-11-23 18:31:06,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-23 18:31:06,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059175404] [2024-11-23 18:31:06,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 18:31:06,280 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 [2024-11-23 18:31:06,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-23 18:31:06,281 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/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) [2024-11-23 18:31:06,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ccc535f9-3102-4205-8d56-c4906728a4c6/bin/uautomizer-verify-LYvppIcaGC/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 (9)] Waiting until timeout for monitored process [2024-11-23 18:31:10,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 18:31:10,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-23 18:31:10,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 18:31:19,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-23 18:31:29,081 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 33 treesize of output 17 [2024-11-23 18:31:36,117 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 33 treesize of output 17 [2024-11-23 18:31:42,606 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 33 treesize of output 17 [2024-11-23 18:31:49,271 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 33 treesize of output 17 [2024-11-23 18:31:55,619 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 30 treesize of output 25 [2024-11-23 18:32:03,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2024-11-23 18:32:10,194 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-23 18:32:10,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 64 [2024-11-23 18:32:10,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:32:10,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 75 [2024-11-23 18:32:11,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2024-11-23 18:32:12,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 18:32:13,181 INFO L349 Elim1Store]: treesize reduction 94, result has 22.3 percent of original size [2024-11-23 18:32:13,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 47 treesize of output 97 [2024-11-23 18:32:14,317 INFO L349 Elim1Store]: treesize reduction 28, result has 39.1 percent of original size [2024-11-23 18:32:14,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 47 [2024-11-23 18:32:21,797 INFO L349 Elim1Store]: treesize reduction 235, result has 26.8 percent of original size [2024-11-23 18:32:21,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 267 treesize of output 299 [2024-11-23 18:32:46,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 47 [2024-11-23 18:32:50,217 INFO L349 Elim1Store]: treesize reduction 84, result has 16.8 percent of original size [2024-11-23 18:32:50,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 68 [2024-11-23 18:32:50,937 INFO L349 Elim1Store]: treesize reduction 84, result has 16.8 percent of original size [2024-11-23 18:32:50,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 69 [2024-11-23 18:32:52,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 47 [2024-11-23 18:32:52,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 47 [2024-11-23 18:32:54,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 15 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 47 [2024-11-23 18:33:07,295 INFO L349 Elim1Store]: treesize reduction 80, result has 17.5 percent of original size [2024-11-23 18:33:07,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 60 [2024-11-23 18:33:11,800 INFO L349 Elim1Store]: treesize reduction 80, result has 17.5 percent of original size [2024-11-23 18:33:11,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 60 [2024-11-23 18:33:14,074 INFO L349 Elim1Store]: treesize reduction 158, result has 21.4 percent of original size [2024-11-23 18:33:14,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 51 treesize of output 89 [2024-11-23 18:33:15,265 INFO L349 Elim1Store]: treesize reduction 80, result has 17.5 percent of original size [2024-11-23 18:33:15,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 60 [2024-11-23 18:33:17,745 INFO L349 Elim1Store]: treesize reduction 80, result has 17.5 percent of original size [2024-11-23 18:33:17,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 60 [2024-11-23 18:33:20,057 INFO L349 Elim1Store]: treesize reduction 158, result has 21.4 percent of original size [2024-11-23 18:33:20,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 52 treesize of output 90 [2024-11-23 18:33:24,879 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~WrapperStruct00_var_1_4_Pointer~0.offset (_ bv2 32)) (let ((.cse5 (select |c_#memory_int#1| c_~WrapperStruct00_var_1_4_Pointer~0.base))) (let ((.cse7 ((_ sign_extend 24) (_ bv0 8))) (.cse24 (select .cse5 (_ bv12 32))) (.cse143 (select .cse5 (_ bv9 32))) (.cse1 ((_ sign_extend 24) (_ bv1 8))) (.cse145 (select .cse5 (_ bv2 32))) (.cse144 (select .cse5 (_ bv11 32)))) (let ((.cse31 (exists ((v_prenex_10 (_ BitVec 8))) (= .cse144 ((_ sign_extend 24) v_prenex_10)))) (.cse32 (exists ((v_prenex_9 (_ BitVec 8))) (let ((.cse151 ((_ sign_extend 24) v_prenex_9))) (and (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse151)) (_ bv4294967295 32)) (= .cse151 .cse145))))) (.cse21 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet46#1_14| (_ BitVec 8))) (let ((.cse150 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet46#1_14|))) (and (= .cse150 .cse145) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse150)) (_ bv4294967295 32)))))) (.cse22 (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet61#1_14| (_ BitVec 8))) (= .cse144 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_14|)))) (.cse26 (exists ((v_prenex_13 (_ BitVec 8))) (= .cse144 ((_ sign_extend 24) v_prenex_13)))) (.cse27 (exists ((v_prenex_11 (_ BitVec 8))) (let ((.cse149 ((_ sign_extend 24) v_prenex_11))) (and (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse149)) (_ bv4294967295 32)) (= .cse149 .cse145))))) (.cse95 (exists ((v_prenex_18 (_ BitVec 8))) (let ((.cse148 ((_ sign_extend 24) v_prenex_18))) (and (= .cse145 .cse148) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse148)) (_ bv4294967295 32)))))) (.cse96 (exists ((v_prenex_21 (_ BitVec 8))) (= .cse144 ((_ sign_extend 24) v_prenex_21)))) (.cse44 (exists ((v_prenex_20 (_ BitVec 32)) (v_prenex_19 (_ BitVec 32))) (and (= (_ bv0 8) ((_ extract 7 0) (select (select |c_#memory_int#1| v_prenex_19) v_prenex_20))) (not (= v_prenex_19 c_~WrapperStruct00_var_1_4_Pointer~0.base))))) (.cse23 (= .cse143 .cse1)) (.cse68 (exists ((v_prenex_23 (_ BitVec 8))) (= .cse144 ((_ sign_extend 24) v_prenex_23)))) (.cse69 (exists ((v_prenex_22 (_ BitVec 8))) (let ((.cse147 ((_ sign_extend 24) v_prenex_22))) (and (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse147)) (_ bv4294967295 32)) (= .cse147 .cse145))))) (.cse9 (exists ((v_prenex_12 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (and (not (= v_prenex_12 c_~WrapperStruct00_var_1_4_Pointer~0.base)) (not (= ((_ extract 7 0) (select (select |c_#memory_int#1| v_prenex_12) v_prenex_3)) (_ bv0 8)))))) (.cse25 (exists ((~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (and (= .cse24 ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base))))) (.cse33 (exists ((v_prenex_15 (_ BitVec 8))) (let ((.cse146 ((_ sign_extend 24) v_prenex_15))) (and (= .cse145 .cse146) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse146)) (_ bv4294967295 32)))))) (.cse34 (exists ((v_prenex_17 (_ BitVec 8))) (= .cse144 ((_ sign_extend 24) v_prenex_17)))) (.cse28 (= .cse143 .cse7)) (.cse3 (select .cse5 (_ bv13 32))) (.cse4 (select .cse5 (_ bv21 32)))) (or (exists ((~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet46#1_14| (_ BitVec 8)) (v_prenex_19 (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (|v_ULTIMATE.start_updateVariables_#t~nondet61#1_14| (_ BitVec 8))) (let ((.cse0 (select |c_#memory_int#1| v_prenex_12)) (.cse2 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet46#1_14|))) (and (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_14|) (select .cse0 (_ bv11 32))) (= (select .cse0 (_ bv9 32)) .cse1) (= .cse0 (select |c_#memory_int#1| v_prenex_19)) (= .cse2 (select .cse0 (_ bv2 32))) (= (store (store (store .cse0 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse2)) (_ bv4294967295 32))))) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base)))) (and (exists ((v_prenex_19 (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_11 (_ BitVec 8)) (v_prenex_13 (_ BitVec 8))) (let ((.cse6 (select |c_#memory_int#1| v_prenex_19)) (.cse8 ((_ sign_extend 24) v_prenex_11))) (and (= (select .cse6 (_ bv11 32)) ((_ sign_extend 24) v_prenex_13)) (= (select .cse6 (_ bv9 32)) .cse7) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse8)) (_ bv4294967295 32)) (= .cse5 (store (store (store .cse6 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse6 ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4)) (= (select .cse6 (_ bv2 32)) .cse8)))) .cse9) (exists ((~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (and (exists ((v_prenex_9 (_ BitVec 8)) (v_prenex_19 (_ BitVec 32)) (v_prenex_10 (_ BitVec 8)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (~WrapperStruct00_var_1_15_Pointer~0.offset (_ BitVec 32))) (let ((.cse10 (select |c_#memory_int#1| v_prenex_19)) (.cse11 ((_ sign_extend 24) v_prenex_9))) (and (= (store (store (store .cse10 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse11)) (_ bv4294967295 32)) (= (_ bv0 8) ((_ extract 7 0) (select .cse10 ~WrapperStruct00_var_1_15_Pointer~0.offset))) (= (select .cse10 (_ bv9 32)) .cse1) (= (select .cse10 (_ bv11 32)) ((_ sign_extend 24) v_prenex_10)) (= (select .cse10 (_ bv2 32)) .cse11)))) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base)))) (exists ((v_prenex_9 (_ BitVec 8)) (v_prenex_19 (_ BitVec 32)) (v_prenex_10 (_ BitVec 8)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (~WrapperStruct00_var_1_15_Pointer~0.offset (_ BitVec 32))) (let ((.cse12 ((_ sign_extend 24) v_prenex_9)) (.cse13 (select |c_#memory_int#1| v_prenex_19))) (and (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse12)) (_ bv4294967295 32)) (= (_ bv0 8) ((_ extract 7 0) (select .cse13 ~WrapperStruct00_var_1_15_Pointer~0.offset))) (= (select .cse13 (_ bv9 32)) .cse1) (= (select .cse13 (_ bv11 32)) ((_ sign_extend 24) v_prenex_10)) (= (select .cse13 (_ bv2 32)) .cse12) (= .cse5 (store (store (store .cse13 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse13 ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4))))) (exists ((~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (and (exists ((~WrapperStruct00_var_1_15_Pointer~0.base (_ BitVec 32)) (v_prenex_9 (_ BitVec 8)) (v_prenex_10 (_ BitVec 8)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (~WrapperStruct00_var_1_15_Pointer~0.offset (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse15 ((_ sign_extend 24) v_prenex_9)) (.cse14 (select |c_#memory_int#1| ~WrapperStruct00_var_1_15_Pointer~0.base)) (.cse16 (select |c_#memory_int#1| v_prenex_12))) (and (= (select .cse14 (_ bv2 32)) .cse15) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse15)) (_ bv4294967295 32)) (= (select .cse14 (_ bv11 32)) ((_ sign_extend 24) v_prenex_10)) (= (store (store (store .cse16 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (= (_ bv0 8) ((_ extract 7 0) (select .cse14 ~WrapperStruct00_var_1_15_Pointer~0.offset))) (= (store .cse14 (_ bv9 32) .cse1) .cse16) (not (= ~WrapperStruct00_var_1_15_Pointer~0.base c_~WrapperStruct00_var_1_4_Pointer~0.base))))) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base)))) (exists ((~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (and (exists ((v_prenex_19 (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_23 (_ BitVec 8)) (v_prenex_22 (_ BitVec 8))) (let ((.cse18 ((_ sign_extend 24) v_prenex_22)) (.cse17 (select |c_#memory_int#1| v_prenex_19))) (and (= (store (store (store .cse17 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (= (select .cse17 (_ bv9 32)) .cse7) (= (select .cse17 (_ bv2 32)) .cse18) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse18)) (_ bv4294967295 32)) (= (select .cse17 (_ bv11 32)) ((_ sign_extend 24) v_prenex_23))))) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base)))) (exists ((v_prenex_20 (_ BitVec 32)) (v_prenex_19 (_ BitVec 32)) (v_prenex_21 (_ BitVec 8)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_18 (_ BitVec 8))) (let ((.cse20 ((_ sign_extend 24) v_prenex_18)) (.cse19 (select |c_#memory_int#1| v_prenex_19))) (and (= ((_ sign_extend 24) v_prenex_21) (select .cse19 (_ bv11 32))) (= (_ bv0 8) ((_ extract 7 0) (select .cse19 v_prenex_20))) (= (select .cse19 (_ bv9 32)) .cse1) (= (select .cse19 (_ bv2 32)) .cse20) (not (= v_prenex_19 c_~WrapperStruct00_var_1_4_Pointer~0.base)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse20)) (_ bv4294967295 32)) (= .cse5 (store (store (store .cse19 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse19 ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4))))) (and .cse21 .cse22 .cse23 (exists ((v_arrayElimCell_50 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_50)) .cse24))) (and .cse25 .cse26 .cse9 .cse27 .cse28) (exists ((~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_23 (_ BitVec 8)) (v_prenex_22 (_ BitVec 8)) (v_prenex_12 (_ BitVec 32))) (let ((.cse30 ((_ sign_extend 24) v_prenex_22)) (.cse29 (select |c_#memory_int#1| v_prenex_12))) (and (= (select .cse29 (_ bv9 32)) .cse7) (= (select .cse29 (_ bv2 32)) .cse30) (= ((_ sign_extend 24) v_prenex_23) (select .cse29 (_ bv11 32))) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse30)) (_ bv4294967295 32)) (= (store (store (store .cse29 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse29 ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5)))) (and .cse31 (exists ((v_arrayElimCell_58 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_58)) .cse24)) .cse32 .cse23) (and (exists ((v_arrayElimCell_71 (_ BitVec 32))) (= .cse24 ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_71)))) .cse33 .cse34 .cse28) (exists ((~WrapperStruct00_var_1_15_Pointer~0.base (_ BitVec 32)) (v_prenex_9 (_ BitVec 8)) (v_prenex_19 (_ BitVec 32)) (v_prenex_10 (_ BitVec 8)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (~WrapperStruct00_var_1_15_Pointer~0.offset (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse36 ((_ sign_extend 24) v_prenex_9)) (.cse35 (select |c_#memory_int#1| ~WrapperStruct00_var_1_15_Pointer~0.base)) (.cse37 (select |c_#memory_int#1| v_prenex_12))) (and (= (select .cse35 (_ bv2 32)) .cse36) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse36)) (_ bv4294967295 32)) (= (select .cse35 (_ bv11 32)) ((_ sign_extend 24) v_prenex_10)) (= .cse37 (select |c_#memory_int#1| v_prenex_19)) (= (store (store (store .cse37 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse37 ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (= (_ bv0 8) ((_ extract 7 0) (select .cse35 ~WrapperStruct00_var_1_15_Pointer~0.offset))) (= (store .cse35 (_ bv9 32) .cse1) .cse37) (not (= ~WrapperStruct00_var_1_15_Pointer~0.base c_~WrapperStruct00_var_1_4_Pointer~0.base))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet46#1_14| (_ BitVec 8)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (|v_ULTIMATE.start_updateVariables_#t~nondet61#1_14| (_ BitVec 8))) (let ((.cse38 (select |c_#memory_int#1| v_prenex_12)) (.cse39 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet46#1_14|))) (and (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_14|) (select .cse38 (_ bv11 32))) (= (select .cse38 (_ bv9 32)) .cse1) (= .cse39 (select .cse38 (_ bv2 32))) (= (store (store (store .cse38 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse38 ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse39)) (_ bv4294967295 32))))) (exists ((v_prenex_9 (_ BitVec 8)) (v_prenex_19 (_ BitVec 32)) (v_prenex_10 (_ BitVec 8)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (~WrapperStruct00_var_1_15_Pointer~0.offset (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse41 ((_ sign_extend 24) v_prenex_9)) (.cse40 (select |c_#memory_int#1| v_prenex_12))) (and (= (select .cse40 (_ bv9 32)) .cse1) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse41)) (_ bv4294967295 32)) (= .cse40 (select |c_#memory_int#1| v_prenex_19)) (= .cse41 (select .cse40 (_ bv2 32))) (= (select .cse40 (_ bv11 32)) ((_ sign_extend 24) v_prenex_10)) (= (store (store (store .cse40 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse40 ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (= (_ bv0 8) ((_ extract 7 0) (select .cse40 ~WrapperStruct00_var_1_15_Pointer~0.offset)))))) (and (exists ((v_prenex_21 (_ BitVec 8)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (v_prenex_18 (_ BitVec 8))) (let ((.cse42 (select |c_#memory_int#1| v_prenex_12)) (.cse43 ((_ sign_extend 24) v_prenex_18))) (and (= (select .cse42 (_ bv9 32)) .cse1) (= ((_ sign_extend 24) v_prenex_21) (select .cse42 (_ bv11 32))) (= (store (store (store .cse42 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse42 ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse43)) (_ bv4294967295 32)) (= (select .cse42 (_ bv2 32)) .cse43)))) .cse44) (exists ((~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet46#1_14| (_ BitVec 8)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (|v_ULTIMATE.start_updateVariables_#t~nondet61#1_14| (_ BitVec 8))) (let ((.cse45 (select |c_#memory_int#1| v_prenex_12)) (.cse46 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet46#1_14|))) (and (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_14|) (select .cse45 (_ bv11 32))) (= (select .cse45 (_ bv9 32)) .cse1) (= .cse46 (select .cse45 (_ bv2 32))) (= (store (store (store .cse45 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse46)) (_ bv4294967295 32))))) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base)))) (and .cse44 (exists ((v_prenex_21 (_ BitVec 8)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32)) (v_prenex_18 (_ BitVec 8))) (let ((.cse47 (select |c_#memory_int#1| v_prenex_12)) (.cse48 ((_ sign_extend 24) v_prenex_18))) (and (= (select .cse47 (_ bv9 32)) .cse1) (= ((_ sign_extend 24) v_prenex_21) (select .cse47 (_ bv11 32))) (= (store (store (store .cse47 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse48)) (_ bv4294967295 32)) (= (select .cse47 (_ bv2 32)) .cse48) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base)))))) (exists ((~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (and (exists ((v_prenex_20 (_ BitVec 32)) (v_prenex_19 (_ BitVec 32)) (v_prenex_21 (_ BitVec 8)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_18 (_ BitVec 8))) (let ((.cse49 (select |c_#memory_int#1| v_prenex_19)) (.cse50 ((_ sign_extend 24) v_prenex_18))) (and (= ((_ sign_extend 24) v_prenex_21) (select .cse49 (_ bv11 32))) (= (_ bv0 8) ((_ extract 7 0) (select .cse49 v_prenex_20))) (= (store (store (store .cse49 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (= (select .cse49 (_ bv9 32)) .cse1) (= (select .cse49 (_ bv2 32)) .cse50) (not (= v_prenex_19 c_~WrapperStruct00_var_1_4_Pointer~0.base)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse50)) (_ bv4294967295 32))))) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base)))) (exists ((~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (and (exists ((~WrapperStruct00_var_1_15_Pointer~0.base (_ BitVec 32)) (v_prenex_9 (_ BitVec 8)) (v_prenex_10 (_ BitVec 8)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (~WrapperStruct00_var_1_15_Pointer~0.offset (_ BitVec 32))) (let ((.cse52 ((_ sign_extend 24) v_prenex_9)) (.cse51 (select |c_#memory_int#1| ~WrapperStruct00_var_1_15_Pointer~0.base))) (and (= (select .cse51 (_ bv2 32)) .cse52) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse52)) (_ bv4294967295 32)) (= (select .cse51 (_ bv11 32)) ((_ sign_extend 24) v_prenex_10)) (= (store (store (store (store .cse51 (_ bv9 32) .cse1) (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (= (_ bv0 8) ((_ extract 7 0) (select .cse51 ~WrapperStruct00_var_1_15_Pointer~0.offset))) (not (= ~WrapperStruct00_var_1_15_Pointer~0.base c_~WrapperStruct00_var_1_4_Pointer~0.base))))) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base)))) (exists ((~WrapperStruct00_var_1_15_Pointer~0.base (_ BitVec 32)) (v_prenex_9 (_ BitVec 8)) (v_prenex_10 (_ BitVec 8)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (~WrapperStruct00_var_1_15_Pointer~0.offset (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse54 ((_ sign_extend 24) v_prenex_9)) (.cse53 (select |c_#memory_int#1| ~WrapperStruct00_var_1_15_Pointer~0.base)) (.cse55 (select |c_#memory_int#1| v_prenex_12))) (and (= (select .cse53 (_ bv2 32)) .cse54) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse54)) (_ bv4294967295 32)) (= (select .cse53 (_ bv11 32)) ((_ sign_extend 24) v_prenex_10)) (= (store (store (store .cse55 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse55 ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (= (_ bv0 8) ((_ extract 7 0) (select .cse53 ~WrapperStruct00_var_1_15_Pointer~0.offset))) (= (store .cse53 (_ bv9 32) .cse1) .cse55) (not (= ~WrapperStruct00_var_1_15_Pointer~0.base c_~WrapperStruct00_var_1_4_Pointer~0.base))))) (exists ((~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 8)) (v_prenex_14 (_ BitVec 32)) (v_prenex_17 (_ BitVec 8))) (let ((.cse57 ((_ sign_extend 24) v_prenex_15)) (.cse56 (select |c_#memory_int#1| v_prenex_14))) (and (= (select .cse56 (_ bv2 32)) .cse57) (not (= v_prenex_14 c_~WrapperStruct00_var_1_4_Pointer~0.base)) (= (select .cse56 (_ bv11 32)) ((_ sign_extend 24) v_prenex_17)) (= .cse5 (store (store (let ((.cse58 (store .cse56 (_ bv9 32) .cse7))) (store .cse58 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse58 ~WrapperStruct00_var_1_5_Pointer~0.offset))))) (_ bv13 32) .cse3) (_ bv21 32) .cse4)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse57)) (_ bv4294967295 32)) (not (= (_ bv0 8) ((_ extract 7 0) (select .cse56 v_prenex_16))))))) (exists ((~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (and (exists ((v_prenex_9 (_ BitVec 8)) (v_prenex_10 (_ BitVec 8)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (~WrapperStruct00_var_1_15_Pointer~0.offset (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse60 ((_ sign_extend 24) v_prenex_9)) (.cse59 (select |c_#memory_int#1| v_prenex_12))) (and (= (select .cse59 (_ bv9 32)) .cse1) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse60)) (_ bv4294967295 32)) (= .cse60 (select .cse59 (_ bv2 32))) (= (select .cse59 (_ bv11 32)) ((_ sign_extend 24) v_prenex_10)) (= (store (store (store .cse59 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (= (_ bv0 8) ((_ extract 7 0) (select .cse59 ~WrapperStruct00_var_1_15_Pointer~0.offset)))))) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base)))) (and .cse25 .cse31 .cse32 .cse23) (exists ((v_prenex_19 (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_23 (_ BitVec 8)) (v_prenex_22 (_ BitVec 8)) (v_prenex_12 (_ BitVec 32))) (let ((.cse62 ((_ sign_extend 24) v_prenex_22)) (.cse61 (select |c_#memory_int#1| v_prenex_12))) (and (= (select .cse61 (_ bv9 32)) .cse7) (= (select .cse61 (_ bv2 32)) .cse62) (= .cse61 (select |c_#memory_int#1| v_prenex_19)) (= ((_ sign_extend 24) v_prenex_23) (select .cse61 (_ bv11 32))) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse62)) (_ bv4294967295 32)) (= (store (store (store .cse61 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse61 ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5)))) (exists ((~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (and (exists ((v_prenex_19 (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_23 (_ BitVec 8)) (v_prenex_22 (_ BitVec 8)) (v_prenex_12 (_ BitVec 32))) (let ((.cse63 (select |c_#memory_int#1| v_prenex_12)) (.cse64 ((_ sign_extend 24) v_prenex_22))) (and (= (select .cse63 (_ bv9 32)) .cse7) (= (select .cse63 (_ bv2 32)) .cse64) (= .cse63 (select |c_#memory_int#1| v_prenex_19)) (= ((_ sign_extend 24) v_prenex_23) (select .cse63 (_ bv11 32))) (= (store (store (store .cse63 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse64)) (_ bv4294967295 32))))) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base)))) (exists ((v_prenex_20 (_ BitVec 32)) (v_prenex_19 (_ BitVec 32)) (v_prenex_21 (_ BitVec 8)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (v_prenex_18 (_ BitVec 8))) (let ((.cse65 (select |c_#memory_int#1| v_prenex_19)) (.cse66 (select |c_#memory_int#1| v_prenex_12)) (.cse67 ((_ sign_extend 24) v_prenex_18))) (and (= (_ bv0 8) ((_ extract 7 0) (select .cse65 v_prenex_20))) (= (select .cse66 (_ bv9 32)) .cse1) (= .cse66 .cse65) (= ((_ sign_extend 24) v_prenex_21) (select .cse66 (_ bv11 32))) (not (= v_prenex_19 c_~WrapperStruct00_var_1_4_Pointer~0.base)) (= (store (store (store .cse66 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse66 ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse67)) (_ bv4294967295 32)) (= (select .cse66 (_ bv2 32)) .cse67)))) (and .cse25 .cse68 .cse69 .cse28) (exists ((~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (and (exists ((v_prenex_9 (_ BitVec 8)) (v_prenex_19 (_ BitVec 32)) (v_prenex_10 (_ BitVec 8)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (~WrapperStruct00_var_1_15_Pointer~0.offset (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse71 ((_ sign_extend 24) v_prenex_9)) (.cse70 (select |c_#memory_int#1| v_prenex_12))) (and (= (select .cse70 (_ bv9 32)) .cse1) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse71)) (_ bv4294967295 32)) (= .cse70 (select |c_#memory_int#1| v_prenex_19)) (= .cse71 (select .cse70 (_ bv2 32))) (= (select .cse70 (_ bv11 32)) ((_ sign_extend 24) v_prenex_10)) (= (store (store (store .cse70 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (= (_ bv0 8) ((_ extract 7 0) (select .cse70 ~WrapperStruct00_var_1_15_Pointer~0.offset)))))) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base)))) (exists ((~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (and (exists ((v_prenex_19 (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_11 (_ BitVec 8)) (v_prenex_13 (_ BitVec 8)) (v_prenex_12 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse73 ((_ sign_extend 24) v_prenex_11)) (.cse72 (select |c_#memory_int#1| v_prenex_12))) (and (= (select .cse72 (_ bv9 32)) .cse7) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse73)) (_ bv4294967295 32)) (= .cse72 (select |c_#memory_int#1| v_prenex_19)) (= (store (store (store .cse72 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (= (select .cse72 (_ bv2 32)) .cse73) (not (= v_prenex_12 c_~WrapperStruct00_var_1_4_Pointer~0.base)) (= (select .cse72 (_ bv11 32)) ((_ sign_extend 24) v_prenex_13)) (not (= ((_ extract 7 0) (select .cse72 v_prenex_3)) (_ bv0 8)))))) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base)))) (exists ((~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_11 (_ BitVec 8)) (v_prenex_13 (_ BitVec 8)) (v_prenex_12 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse75 ((_ sign_extend 24) v_prenex_11)) (.cse74 (select |c_#memory_int#1| v_prenex_12))) (and (= (select .cse74 (_ bv9 32)) .cse7) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse75)) (_ bv4294967295 32)) (= (store (store (store .cse74 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse74 ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (= (select .cse74 (_ bv2 32)) .cse75) (not (= v_prenex_12 c_~WrapperStruct00_var_1_4_Pointer~0.base)) (= (select .cse74 (_ bv11 32)) ((_ sign_extend 24) v_prenex_13)) (not (= ((_ extract 7 0) (select .cse74 v_prenex_3)) (_ bv0 8)))))) (exists ((~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (and (exists ((~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 8)) (v_prenex_14 (_ BitVec 32)) (v_prenex_17 (_ BitVec 8))) (let ((.cse77 ((_ sign_extend 24) v_prenex_15)) (.cse76 (select |c_#memory_int#1| v_prenex_14))) (and (= (select .cse76 (_ bv2 32)) .cse77) (not (= v_prenex_14 c_~WrapperStruct00_var_1_4_Pointer~0.base)) (= (select .cse76 (_ bv11 32)) ((_ sign_extend 24) v_prenex_17)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse77)) (_ bv4294967295 32)) (= (store (store (store (store .cse76 (_ bv9 32) .cse7) (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (not (= (_ bv0 8) ((_ extract 7 0) (select .cse76 v_prenex_16))))))) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base)))) (exists ((~WrapperStruct00_var_1_15_Pointer~0.base (_ BitVec 32)) (v_prenex_9 (_ BitVec 8)) (v_prenex_19 (_ BitVec 32)) (v_prenex_10 (_ BitVec 8)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (~WrapperStruct00_var_1_15_Pointer~0.offset (_ BitVec 32))) (let ((.cse79 ((_ sign_extend 24) v_prenex_9)) (.cse78 (select |c_#memory_int#1| ~WrapperStruct00_var_1_15_Pointer~0.base)) (.cse80 (select |c_#memory_int#1| v_prenex_19))) (and (= (select .cse78 (_ bv2 32)) .cse79) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse79)) (_ bv4294967295 32)) (= (select .cse78 (_ bv11 32)) ((_ sign_extend 24) v_prenex_10)) (= (_ bv0 8) ((_ extract 7 0) (select .cse78 ~WrapperStruct00_var_1_15_Pointer~0.offset))) (= .cse5 (store (store (store .cse80 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse80 ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4)) (= (store .cse78 (_ bv9 32) .cse1) .cse80) (not (= ~WrapperStruct00_var_1_15_Pointer~0.base c_~WrapperStruct00_var_1_4_Pointer~0.base))))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet46#1_14| (_ BitVec 8)) (v_prenex_19 (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (|v_ULTIMATE.start_updateVariables_#t~nondet61#1_14| (_ BitVec 8))) (let ((.cse81 (select |c_#memory_int#1| v_prenex_12)) (.cse82 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet46#1_14|))) (and (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_14|) (select .cse81 (_ bv11 32))) (= (select .cse81 (_ bv9 32)) .cse1) (= .cse81 (select |c_#memory_int#1| v_prenex_19)) (= .cse82 (select .cse81 (_ bv2 32))) (= (store (store (store .cse81 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse81 ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse82)) (_ bv4294967295 32))))) (exists ((~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (and (exists ((~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (v_prenex_15 (_ BitVec 8)) (v_prenex_17 (_ BitVec 8))) (let ((.cse83 (select |c_#memory_int#1| v_prenex_12)) (.cse84 ((_ sign_extend 24) v_prenex_15))) (and (= (select .cse83 (_ bv9 32)) .cse7) (= ((_ sign_extend 24) v_prenex_17) (select .cse83 (_ bv11 32))) (not (= ((_ extract 7 0) (select .cse83 v_prenex_16)) (_ bv0 8))) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse84)) (_ bv4294967295 32)) (= (store (store (store .cse83 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (= (select .cse83 (_ bv2 32)) .cse84)))) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base)))) (exists ((~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (v_prenex_15 (_ BitVec 8)) (v_prenex_14 (_ BitVec 32)) (v_prenex_17 (_ BitVec 8))) (let ((.cse86 ((_ sign_extend 24) v_prenex_15)) (.cse85 (select |c_#memory_int#1| v_prenex_14)) (.cse87 (select |c_#memory_int#1| v_prenex_12))) (and (= (select .cse85 (_ bv2 32)) .cse86) (not (= v_prenex_14 c_~WrapperStruct00_var_1_4_Pointer~0.base)) (= (select .cse85 (_ bv11 32)) ((_ sign_extend 24) v_prenex_17)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse86)) (_ bv4294967295 32)) (not (= (_ bv0 8) ((_ extract 7 0) (select .cse85 v_prenex_16)))) (= .cse87 (store .cse85 (_ bv9 32) .cse7)) (= (store (store (store .cse87 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse87 ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5)))) (exists ((~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (and (exists ((~WrapperStruct00_var_1_15_Pointer~0.base (_ BitVec 32)) (v_prenex_9 (_ BitVec 8)) (v_prenex_19 (_ BitVec 32)) (v_prenex_10 (_ BitVec 8)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (~WrapperStruct00_var_1_15_Pointer~0.offset (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse89 ((_ sign_extend 24) v_prenex_9)) (.cse88 (select |c_#memory_int#1| ~WrapperStruct00_var_1_15_Pointer~0.base)) (.cse90 (select |c_#memory_int#1| v_prenex_12))) (and (= (select .cse88 (_ bv2 32)) .cse89) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse89)) (_ bv4294967295 32)) (= (select .cse88 (_ bv11 32)) ((_ sign_extend 24) v_prenex_10)) (= .cse90 (select |c_#memory_int#1| v_prenex_19)) (= (store (store (store .cse90 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (= (_ bv0 8) ((_ extract 7 0) (select .cse88 ~WrapperStruct00_var_1_15_Pointer~0.offset))) (= (store .cse88 (_ bv9 32) .cse1) .cse90) (not (= ~WrapperStruct00_var_1_15_Pointer~0.base c_~WrapperStruct00_var_1_4_Pointer~0.base))))) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base)))) (exists ((~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (and (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base)) (exists ((~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_23 (_ BitVec 8)) (v_prenex_22 (_ BitVec 8)) (v_prenex_12 (_ BitVec 32))) (let ((.cse91 (select |c_#memory_int#1| v_prenex_12)) (.cse92 ((_ sign_extend 24) v_prenex_22))) (and (= (select .cse91 (_ bv9 32)) .cse7) (= (select .cse91 (_ bv2 32)) .cse92) (= ((_ sign_extend 24) v_prenex_23) (select .cse91 (_ bv11 32))) (= (store (store (store .cse91 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse92)) (_ bv4294967295 32))))))) (exists ((v_prenex_9 (_ BitVec 8)) (v_prenex_10 (_ BitVec 8)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (~WrapperStruct00_var_1_15_Pointer~0.offset (_ BitVec 32)) (v_prenex_12 (_ BitVec 32))) (let ((.cse94 ((_ sign_extend 24) v_prenex_9)) (.cse93 (select |c_#memory_int#1| v_prenex_12))) (and (= (select .cse93 (_ bv9 32)) .cse1) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse94)) (_ bv4294967295 32)) (= .cse94 (select .cse93 (_ bv2 32))) (= (select .cse93 (_ bv11 32)) ((_ sign_extend 24) v_prenex_10)) (= (store (store (store .cse93 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse93 ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (= (_ bv0 8) ((_ extract 7 0) (select .cse93 ~WrapperStruct00_var_1_15_Pointer~0.offset)))))) (and .cse25 .cse21 .cse22 .cse23) (and (exists ((v_arrayElimCell_63 (_ BitVec 32))) (= ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_63)) .cse24)) .cse95 .cse96 .cse44 .cse23) (exists ((~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (and (exists ((v_prenex_20 (_ BitVec 32)) (v_prenex_19 (_ BitVec 32)) (v_prenex_21 (_ BitVec 8)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (v_prenex_18 (_ BitVec 8))) (let ((.cse97 (select |c_#memory_int#1| v_prenex_19)) (.cse98 (select |c_#memory_int#1| v_prenex_12)) (.cse99 ((_ sign_extend 24) v_prenex_18))) (and (= (_ bv0 8) ((_ extract 7 0) (select .cse97 v_prenex_20))) (= (select .cse98 (_ bv9 32)) .cse1) (= .cse98 .cse97) (= ((_ sign_extend 24) v_prenex_21) (select .cse98 (_ bv11 32))) (= (store (store (store .cse98 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (not (= v_prenex_19 c_~WrapperStruct00_var_1_4_Pointer~0.base)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse99)) (_ bv4294967295 32)) (= (select .cse98 (_ bv2 32)) .cse99)))) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base)))) (exists ((v_prenex_19 (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_23 (_ BitVec 8)) (v_prenex_22 (_ BitVec 8))) (let ((.cse101 ((_ sign_extend 24) v_prenex_22)) (.cse100 (select |c_#memory_int#1| v_prenex_19))) (and (= (select .cse100 (_ bv9 32)) .cse7) (= (select .cse100 (_ bv2 32)) .cse101) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse101)) (_ bv4294967295 32)) (= .cse5 (store (store (store .cse100 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse100 ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4)) (= (select .cse100 (_ bv11 32)) ((_ sign_extend 24) v_prenex_23))))) (exists ((~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (v_prenex_15 (_ BitVec 8)) (v_prenex_17 (_ BitVec 8))) (let ((.cse102 (select |c_#memory_int#1| v_prenex_12)) (.cse103 ((_ sign_extend 24) v_prenex_15))) (and (= (select .cse102 (_ bv9 32)) .cse7) (= ((_ sign_extend 24) v_prenex_17) (select .cse102 (_ bv11 32))) (not (= ((_ extract 7 0) (select .cse102 v_prenex_16)) (_ bv0 8))) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse103)) (_ bv4294967295 32)) (= (store (store (store .cse102 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse102 ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (= (select .cse102 (_ bv2 32)) .cse103)))) (exists ((v_prenex_19 (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 8)) (v_prenex_17 (_ BitVec 8))) (let ((.cse105 ((_ sign_extend 24) v_prenex_15)) (.cse104 (select |c_#memory_int#1| v_prenex_19))) (and (= (select .cse104 (_ bv2 32)) .cse105) (= (select .cse104 (_ bv9 32)) .cse7) (not (= (_ bv0 8) ((_ extract 7 0) (select .cse104 v_prenex_16)))) (= ((_ sign_extend 24) v_prenex_17) (select .cse104 (_ bv11 32))) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse105)) (_ bv4294967295 32)) (= .cse5 (store (store (store .cse104 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse104 ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4))))) (exists ((~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (and (exists ((v_prenex_19 (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (v_prenex_15 (_ BitVec 8)) (v_prenex_14 (_ BitVec 32)) (v_prenex_17 (_ BitVec 8))) (let ((.cse107 ((_ sign_extend 24) v_prenex_15)) (.cse108 (select |c_#memory_int#1| v_prenex_12)) (.cse106 (select |c_#memory_int#1| v_prenex_14))) (and (= (select .cse106 (_ bv2 32)) .cse107) (not (= v_prenex_14 c_~WrapperStruct00_var_1_4_Pointer~0.base)) (= (select .cse106 (_ bv11 32)) ((_ sign_extend 24) v_prenex_17)) (= .cse108 (select |c_#memory_int#1| v_prenex_19)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse107)) (_ bv4294967295 32)) (not (= (_ bv0 8) ((_ extract 7 0) (select .cse106 v_prenex_16)))) (= (store (store (store .cse108 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (= .cse108 (store .cse106 (_ bv9 32) .cse7))))) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base)))) (exists ((v_prenex_19 (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (v_prenex_15 (_ BitVec 8)) (v_prenex_17 (_ BitVec 8))) (let ((.cse109 (select |c_#memory_int#1| v_prenex_12)) (.cse110 ((_ sign_extend 24) v_prenex_15))) (and (= (select .cse109 (_ bv9 32)) .cse7) (= ((_ sign_extend 24) v_prenex_17) (select .cse109 (_ bv11 32))) (not (= ((_ extract 7 0) (select .cse109 v_prenex_16)) (_ bv0 8))) (= .cse109 (select |c_#memory_int#1| v_prenex_19)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse110)) (_ bv4294967295 32)) (= (store (store (store .cse109 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse109 ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (= (select .cse109 (_ bv2 32)) .cse110)))) (exists ((~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (and (exists ((v_prenex_19 (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 8)) (v_prenex_14 (_ BitVec 32)) (v_prenex_17 (_ BitVec 8))) (let ((.cse113 ((_ sign_extend 24) v_prenex_15)) (.cse111 (select |c_#memory_int#1| v_prenex_19)) (.cse112 (select |c_#memory_int#1| v_prenex_14))) (and (= (store (store (store .cse111 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (= (select .cse112 (_ bv2 32)) .cse113) (not (= v_prenex_14 c_~WrapperStruct00_var_1_4_Pointer~0.base)) (= (select .cse112 (_ bv11 32)) ((_ sign_extend 24) v_prenex_17)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse113)) (_ bv4294967295 32)) (not (= (_ bv0 8) ((_ extract 7 0) (select .cse112 v_prenex_16)))) (= .cse111 (store .cse112 (_ bv9 32) .cse7))))) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base)))) (and .cse26 (exists ((v_arrayElimCell_54 (_ BitVec 32))) (= .cse24 ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_54)))) .cse9 .cse27 .cse28) (and .cse95 .cse25 .cse96 .cse44 .cse23) (exists ((v_prenex_19 (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (v_prenex_15 (_ BitVec 8)) (v_prenex_14 (_ BitVec 32)) (v_prenex_17 (_ BitVec 8))) (let ((.cse115 ((_ sign_extend 24) v_prenex_15)) (.cse114 (select |c_#memory_int#1| v_prenex_14)) (.cse116 (select |c_#memory_int#1| v_prenex_12))) (and (= (select .cse114 (_ bv2 32)) .cse115) (not (= v_prenex_14 c_~WrapperStruct00_var_1_4_Pointer~0.base)) (= (select .cse114 (_ bv11 32)) ((_ sign_extend 24) v_prenex_17)) (= .cse116 (select |c_#memory_int#1| v_prenex_19)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse115)) (_ bv4294967295 32)) (not (= (_ bv0 8) ((_ extract 7 0) (select .cse114 v_prenex_16)))) (= .cse116 (store .cse114 (_ bv9 32) .cse7)) (= (store (store (store .cse116 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse116 ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5)))) (exists ((~WrapperStruct00_var_1_15_Pointer~0.base (_ BitVec 32)) (v_prenex_9 (_ BitVec 8)) (v_prenex_10 (_ BitVec 8)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (~WrapperStruct00_var_1_15_Pointer~0.offset (_ BitVec 32))) (let ((.cse118 ((_ sign_extend 24) v_prenex_9)) (.cse117 (select |c_#memory_int#1| ~WrapperStruct00_var_1_15_Pointer~0.base))) (and (= (select .cse117 (_ bv2 32)) .cse118) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse118)) (_ bv4294967295 32)) (= (select .cse117 (_ bv11 32)) ((_ sign_extend 24) v_prenex_10)) (= .cse5 (store (store (let ((.cse119 (store .cse117 (_ bv9 32) .cse1))) (store .cse119 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse119 ~WrapperStruct00_var_1_5_Pointer~0.offset))))) (_ bv13 32) .cse3) (_ bv21 32) .cse4)) (= (_ bv0 8) ((_ extract 7 0) (select .cse117 ~WrapperStruct00_var_1_15_Pointer~0.offset))) (not (= ~WrapperStruct00_var_1_15_Pointer~0.base c_~WrapperStruct00_var_1_4_Pointer~0.base))))) (and .cse68 (exists ((v_arrayElimCell_67 (_ BitVec 32))) (= .cse24 ((_ sign_extend 24) ((_ extract 7 0) v_arrayElimCell_67)))) .cse69 .cse28) (exists ((~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (and (exists ((~WrapperStruct00_var_1_15_Pointer~0.base (_ BitVec 32)) (v_prenex_9 (_ BitVec 8)) (v_prenex_19 (_ BitVec 32)) (v_prenex_10 (_ BitVec 8)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (~WrapperStruct00_var_1_15_Pointer~0.offset (_ BitVec 32))) (let ((.cse121 ((_ sign_extend 24) v_prenex_9)) (.cse120 (select |c_#memory_int#1| ~WrapperStruct00_var_1_15_Pointer~0.base)) (.cse122 (select |c_#memory_int#1| v_prenex_19))) (and (= (select .cse120 (_ bv2 32)) .cse121) (= (store (store (store .cse122 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse121)) (_ bv4294967295 32)) (= (select .cse120 (_ bv11 32)) ((_ sign_extend 24) v_prenex_10)) (= (_ bv0 8) ((_ extract 7 0) (select .cse120 ~WrapperStruct00_var_1_15_Pointer~0.offset))) (= (store .cse120 (_ bv9 32) .cse1) .cse122) (not (= ~WrapperStruct00_var_1_15_Pointer~0.base c_~WrapperStruct00_var_1_4_Pointer~0.base))))) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base)))) (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet46#1_14| (_ BitVec 8)) (v_prenex_19 (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (|v_ULTIMATE.start_updateVariables_#t~nondet61#1_14| (_ BitVec 8))) (let ((.cse124 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet46#1_14|)) (.cse123 (select |c_#memory_int#1| v_prenex_19))) (and (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_14|) (select .cse123 (_ bv11 32))) (= (select .cse123 (_ bv2 32)) .cse124) (= (select .cse123 (_ bv9 32)) .cse1) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse124)) (_ bv4294967295 32)) (= .cse5 (store (store (store .cse123 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse123 ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4))))) (and (exists ((v_prenex_19 (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_11 (_ BitVec 8)) (v_prenex_13 (_ BitVec 8)) (~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (let ((.cse125 (select |c_#memory_int#1| v_prenex_19)) (.cse126 ((_ sign_extend 24) v_prenex_11))) (and (= (store (store (store .cse125 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (= (select .cse125 (_ bv11 32)) ((_ sign_extend 24) v_prenex_13)) (= (select .cse125 (_ bv9 32)) .cse7) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse126)) (_ bv4294967295 32)) (= (select .cse125 (_ bv2 32)) .cse126) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base))))) .cse9) (and .cse25 .cse33 .cse34 .cse28) (exists ((~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (and (exists ((~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_11 (_ BitVec 8)) (v_prenex_13 (_ BitVec 8)) (v_prenex_12 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse128 ((_ sign_extend 24) v_prenex_11)) (.cse127 (select |c_#memory_int#1| v_prenex_12))) (and (= (select .cse127 (_ bv9 32)) .cse7) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse128)) (_ bv4294967295 32)) (= (store (store (store .cse127 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (= (select .cse127 (_ bv2 32)) .cse128) (not (= v_prenex_12 c_~WrapperStruct00_var_1_4_Pointer~0.base)) (= (select .cse127 (_ bv11 32)) ((_ sign_extend 24) v_prenex_13)) (not (= ((_ extract 7 0) (select .cse127 v_prenex_3)) (_ bv0 8)))))) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base)))) (exists ((~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (and (exists ((|v_ULTIMATE.start_updateVariables_#t~nondet46#1_14| (_ BitVec 8)) (v_prenex_19 (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (|v_ULTIMATE.start_updateVariables_#t~nondet61#1_14| (_ BitVec 8))) (let ((.cse129 (select |c_#memory_int#1| v_prenex_19)) (.cse130 ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet46#1_14|))) (and (= (store (store (store .cse129 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (= ((_ sign_extend 24) |v_ULTIMATE.start_updateVariables_#t~nondet61#1_14|) (select .cse129 (_ bv11 32))) (= (select .cse129 (_ bv2 32)) .cse130) (= (select .cse129 (_ bv9 32)) .cse1) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse130)) (_ bv4294967295 32))))) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base)))) (exists ((v_prenex_19 (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_11 (_ BitVec 8)) (v_prenex_13 (_ BitVec 8)) (v_prenex_12 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32))) (let ((.cse132 ((_ sign_extend 24) v_prenex_11)) (.cse131 (select |c_#memory_int#1| v_prenex_12))) (and (= (select .cse131 (_ bv9 32)) .cse7) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse132)) (_ bv4294967295 32)) (= .cse131 (select |c_#memory_int#1| v_prenex_19)) (= (store (store (store .cse131 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse131 ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (= (select .cse131 (_ bv2 32)) .cse132) (not (= v_prenex_12 c_~WrapperStruct00_var_1_4_Pointer~0.base)) (= (select .cse131 (_ bv11 32)) ((_ sign_extend 24) v_prenex_13)) (not (= ((_ extract 7 0) (select .cse131 v_prenex_3)) (_ bv0 8)))))) (exists ((~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (and (exists ((v_prenex_19 (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 8)) (v_prenex_17 (_ BitVec 8))) (let ((.cse133 (select |c_#memory_int#1| v_prenex_19)) (.cse134 ((_ sign_extend 24) v_prenex_15))) (and (= (select .cse133 (_ bv2 32)) .cse134) (= (store (store (store .cse133 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (= (select .cse133 (_ bv9 32)) .cse7) (not (= (_ bv0 8) ((_ extract 7 0) (select .cse133 v_prenex_16)))) (= ((_ sign_extend 24) v_prenex_17) (select .cse133 (_ bv11 32))) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse134)) (_ bv4294967295 32))))) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base)))) (exists ((~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (and (exists ((v_prenex_19 (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (v_prenex_15 (_ BitVec 8)) (v_prenex_17 (_ BitVec 8))) (let ((.cse135 (select |c_#memory_int#1| v_prenex_12)) (.cse136 ((_ sign_extend 24) v_prenex_15))) (and (= (select .cse135 (_ bv9 32)) .cse7) (= ((_ sign_extend 24) v_prenex_17) (select .cse135 (_ bv11 32))) (not (= ((_ extract 7 0) (select .cse135 v_prenex_16)) (_ bv0 8))) (= .cse135 (select |c_#memory_int#1| v_prenex_19)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse136)) (_ bv4294967295 32)) (= (store (store (store .cse135 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (= (select .cse135 (_ bv2 32)) .cse136)))) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base)))) (exists ((~WrapperStruct00_var_1_5_Pointer~0.base (_ BitVec 32))) (and (exists ((~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (v_prenex_15 (_ BitVec 8)) (v_prenex_14 (_ BitVec 32)) (v_prenex_17 (_ BitVec 8))) (let ((.cse138 ((_ sign_extend 24) v_prenex_15)) (.cse139 (select |c_#memory_int#1| v_prenex_12)) (.cse137 (select |c_#memory_int#1| v_prenex_14))) (and (= (select .cse137 (_ bv2 32)) .cse138) (not (= v_prenex_14 c_~WrapperStruct00_var_1_4_Pointer~0.base)) (= (select .cse137 (_ bv11 32)) ((_ sign_extend 24) v_prenex_17)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse138)) (_ bv4294967295 32)) (not (= (_ bv0 8) ((_ extract 7 0) (select .cse137 v_prenex_16)))) (= (store (store (store .cse139 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select (select |c_#memory_int#1| ~WrapperStruct00_var_1_5_Pointer~0.base) ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4) .cse5) (= .cse139 (store .cse137 (_ bv9 32) .cse7))))) (not (= c_~WrapperStruct00_var_1_4_Pointer~0.base ~WrapperStruct00_var_1_5_Pointer~0.base)))) (exists ((v_prenex_19 (_ BitVec 32)) (~WrapperStruct00_var_1_5_Pointer~0.offset (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 8)) (v_prenex_14 (_ BitVec 32)) (v_prenex_17 (_ BitVec 8))) (let ((.cse141 ((_ sign_extend 24) v_prenex_15)) (.cse140 (select |c_#memory_int#1| v_prenex_14)) (.cse142 (select |c_#memory_int#1| v_prenex_19))) (and (= (select .cse140 (_ bv2 32)) .cse141) (not (= v_prenex_14 c_~WrapperStruct00_var_1_4_Pointer~0.base)) (= (select .cse140 (_ bv11 32)) ((_ sign_extend 24) v_prenex_17)) (bvsge ((_ sign_extend 24) ((_ extract 7 0) .cse141)) (_ bv4294967295 32)) (not (= (_ bv0 8) ((_ extract 7 0) (select .cse140 v_prenex_16)))) (= .cse142 (store .cse140 (_ bv9 32) .cse7)) (= .cse5 (store (store (store .cse142 (_ bv12 32) ((_ sign_extend 24) ((_ extract 7 0) (select .cse142 ~WrapperStruct00_var_1_5_Pointer~0.offset)))) (_ bv13 32) .cse3) (_ bv21 32) .cse4))))))))) (= c_~WrapperStruct00_var_1_1_Pointer~0.base c_~WrapperStruct00_var_1_4_Pointer~0.base) (= (_ bv0 32) c_~WrapperStruct00_var_1_1_Pointer~0.offset)) is different from false